Atkin's test: news from the front (1990)

Cached

Download Links

by François Morain
Venue:IN ADVANCES IN CRYPTOLOGY
Citations:2 - 2 self

Active Bibliography

2 DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3 – François Morain - 1991
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
5 Elliptic Curves, Primality Proving And Some Titanic Primes – François Morain - 1989
96 Speeding Up The Computations On An Elliptic Curve Using Addition-Subtraction Chains – François Morain, Jorge Olivos - 1990
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
unknown title – Foreword Whitfield Diffie
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
18 Building Cyclic Elliptic Curves Modulo Large Primes – François Morain - 1987
Easy numbers for the Elliptic Curve Primality Proving Algorithm – F. Morain - 1992
22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
23 Information and Computation: Classical and Quantum Aspects – A. Galindo, M. A. Martín-delgado - 2001
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
Pseudoprimes: A Survey Of Recent Results – François Morain - 1992
2 Cyclotomy primality proofs and their certificates. Mathematica Goettingensis – Preda Mihăilescu - 2006
1 Counting points on elliptic curves over F p n using Couveignes's algorithm – Reynald Lercier, François Morain - 1995