Pseudoprimes: A Survey Of Recent Results (1992)

Cached

Download Links

by François Morain

Active Bibliography

2 Building Pseudoprimes With A Large Number Of Prime Factors – D. Guillaume, F. Morain - 1995
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
2 DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3 – François Morain - 1991
2 Atkin's test: news from the front – Franqois Morain, Dipartement De Mathkmatiques, Universitk Claude Bernard - 1990
22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
3 Some Primality Testing Algorithms – R.G.E. Pinch - 1993
unknown title – Foreword Whitfield Diffie
3 Two Observations on Probabilistic Primality Testing – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Universite De Montreal C. P - 1987
1 ON THE EXISTENCE AND NON-EXISTENCE OF ELLIPTIC PSEUDOPRIMES – Siguna Müller
Enjeux Et Avancées De La Théorie Algorithmique Des Nombres – François Morain - 1992
5 Elliptic Curves, Primality Proving And Some Titanic Primes – François Morain - 1989
3 Fast Generation of Prime Numbers of Portable Devices: An Update – Marc Joye, Pascal Paillier - 2006
Easy numbers for the Elliptic Curve Primality Proving Algorithm – F. Morain - 1992
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992
ABSOLUTE QUADRATIC PSEUDOPRIMES – Richard G. E. Pinch
71 There are infinitely many Carmichael numbers – W. R. Alford, Andrew Granville, Carl Pomerance - 1982
11 A Probable Prime Test With High Confidence – Jon Grantham