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.
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.
Easy numbers for the Elliptic Curve Primality Proving Algorithm
, 1992
"... We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given. ..."
Abstract
- Add to MetaCart
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given.
