Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Strong primes are easy to find
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Mathematics of Computation
The generation of random numbers that are probably prime
Journal of Cryptology
Modern cryptology
American Mathematical Monthly
Introduction to programmable active memories
Systolic array processors
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Atkin's test: news from the front
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Easy numbers for the elliptic curve primality proving algorithm
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Locality, causality and continuations
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Fast Generation of Provable Primes Using Search in Arithmetic Progressions
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.00 |
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 l065-digit (23539+1)/3, the first ordinary Titanic prime.