TWO KINDS OF STRONG PSEUDOPRIMES UP TO 10 36

by Zhenxiang Zhang

Active Bibliography

1 Finding strong pseudoprimes to several bases. II,Math – Zhenxiang Zhang, Min Tang
2 A one-parameter quadratic-base version of the Baillie–PSW probable prime test – Zhenxiang Zhang
NOTES ON SOME NEW KINDS OF PSEUDOPRIMES – Zhenxiang Zhang
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
1 The Pseudosquares Prime Sieve – Jonathan P. Sorenson
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992
22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
A GENERALIZATION OF MILLER’S PRIMALITY THEOREM PEDRO BERRIZBEITIA AND AURORA OLIVIERI – Communicated Ken Ono
3 The Rabin-Monier theorem for Lucas pseudoprimes – F. Arnault - 1997
5 Primality Testing Revisited – J.H. Davenport - 1992
Improved Bounds for Goldback Conjecture – Yannick Saouter
3 Further investigations with the strong probable prime test – Ronald Joseph Burthe - 1996
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
3 Two Observations on Probabilistic Primality Testing – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Universite De Montreal C. P - 1987
18.783 Elliptic Curves Spring 2013 Lecture #13 03/21/2013 – unknown authors
Small Base Groups, Large Base Groups and the Case of Giants – Jonathan Cohen
CS 810: Introduction to Complexity Theory 10/17/03 Lecture 14: Probabilistic Computation, MAX-CUT – Instructor Jin-yi, Cai Scribe, Rakesh Kumar, Yunpeng Li