Results 1 -
3 of
3
Elliptic Curves And Primality Proving
- Math. Comp
, 1993
"... The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. ..."
Abstract
-
Cited by 138 (21 self)
- Add to MetaCart
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm.
Atkin's test: news from the front
- In Advances in Cryptology
, 1990
"... We make an attempt to compare the speed of eeme primality testing algorithms for certifying loo-digit prime numbers. 1. Introduction. The ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We make an attempt to compare the speed of eeme primality testing algorithms for certifying loo-digit prime numbers. 1. Introduction. The
DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3
, 1991
"... We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the lO65-digit (2^3539+ l)/3, the fir ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the lO65-digit (2^3539+ l)/3, the first ordinary Titanic prime.
