Further investigations with the strong probable prime test (1996)

Cached

Download Links

by Ronald Joseph Burthe
Venue:Math. Comp
Citations:3 - 0 self

Active Bibliography

22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
MO419 – Probabilistic Algorithms – Flávio K. Miyazawa – IC/UNICAMP 2010 A survey on Probabilistic Algorithms to Primality Test – Marcio Machado, Pereira Ra, Marco Alves, Ganhoto Ra
11 A Probable Prime Test With High Confidence – Jon Grantham
and – Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen - 1993
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
Chapter 1—Foundations 1.1 Terminology – Bruce Schneier, Wiley Computer Publishing, John Wiley, Whitfield Diffie
unknown title – Foreword Whitfield Diffie
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992
1 Finding strong pseudoprimes to several bases. II,Math – Zhenxiang Zhang, Min Tang
TWO KINDS OF STRONG PSEUDOPRIMES UP TO 10 36 – Zhenxiang Zhang
2 A one-parameter quadratic-base version of the Baillie–PSW probable prime test – Zhenxiang Zhang
A GENERALIZATION OF MILLER’S PRIMALITY THEOREM PEDRO BERRIZBEITIA AND AURORA OLIVIERI – Communicated Ken Ono
3 Some Primality Testing Algorithms – R.G.E. Pinch - 1993
150 Signature Schemes Based on the Strong RSA Assumption – Ronald Cramer, Victor Shoup - 1998
Breaking a Cryptographic Protocol with – Daniel Bleichenbacher
3 The Bloom Paradox: When not to Use a Bloom Filter? – Ori Rottenstreich, Isaac Keslassy
Pseudoprimes: A Survey Of Recent Results – François Morain - 1992