DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3 (1991)

by François Morain
Citations:2 - 1 self

Active Bibliography

2 Atkin's test: news from the front – Franqois Morain, Dipartement De Mathkmatiques, Universitk Claude Bernard - 1990
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
5 Elliptic Curves, Primality Proving And Some Titanic Primes – François Morain - 1989
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
Easy numbers for the Elliptic Curve Primality Proving Algorithm – F. Morain - 1992
100 Speeding Up The Computations On An Elliptic Curve Using Addition-Subtraction Chains – François Morain, Jorge Olivos - 1990
1 Counting points on elliptic curves over F p n using Couveignes's algorithm – Reynald Lercier, François Morain - 1995
8 Primality proving using elliptic curves: An update – F. Morain - 1998
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
Enjeux Et Avancées De La Théorie Algorithmique Des Nombres – François Morain - 1992
18 Building Cyclic Elliptic Curves Modulo Large Primes – François Morain - 1987
unknown title – unknown authors - 2004
14 Sign Change Fault Attacks on Elliptic Curve Cryptosystems – Johannes Blömer, Martin Otto, Jean-Pierre Seifert - 2004
Pseudoprimes: A Survey Of Recent Results – François Morain - 1992
unknown title – Foreword Whitfield Diffie
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995