Some Primality Testing Algorithms

Some Primality Testing Algorithms (1993)

by R.G.E. Pinch

Venue:	Notices of the AMS
Citations:	3 - 0 self

	Primality testing – Richard P. Brent - 2003
3	Primality testing – Richard P - 1992
3	Primality Testing Revisited – J.H. Davenport - 1992
6	Towards a deterministic polynomial-time Primality Test – Neeraj Kayal, Nitin Saxena, Supervisor Dr. Manindra Agarwal - 2002
	Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent - 2006
	Abstract Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent
2	A one-parameter quadratic-base version of the Baillie–PSW probable prime test – Zhenxiang Zhang
	Modern Primality Tests and the Agrawal-Kayal-Saxena Algorithm – Jason Wojciechowski - 2003
3	Four primality testing algorithms – René Schoof - 2008
23	Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
	Riemann and his zeta function ∗ – Elena A. Kudryavtseva, Filip Saidak, Peter Zvengrowski
16	The Carmichael Numbers up to 10^15 – R.G.E. Pinch - 1992
9	Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
	Fast Primality Proving on Cullen Numbers – Tsz-wo Sze - 2009
	and – Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen - 1993
	Computations on Normal Families of Primes – Erick Wong - 1997
39	Parallel Algorithms for Integer Factorisation – Richard P. Brent
	Enjeux Et Avancées De La Théorie Algorithmique Des Nombres – François Morain - 1992
	ABSOLUTE QUADRATIC PSEUDOPRIMES – Richard G. E. Pinch