Primality Testing Revisited (1992)

Cached

Download Links

by J.H. Davenport
Citations:5 - 0 self

Active Bibliography

3 Some Primality Testing Algorithms – R.G.E. Pinch - 1993
13 Efficiency and Security of Cryptosystems Based on Number Theory – Daniel Bleichenbacher - 1996
Pseudoprimes: A Survey Of Recent Results – François Morain - 1992
10 Comments on search procedures for primitive roots – Eric Bach - 1997
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
3 The Rabin-Monier theorem for Lucas pseudoprimes – F. Arnault - 1997
17 Explicit bounds for primes in residue classes – Eric Bach, Jonathan Sorenson - 1996
3 Four primality testing algorithms – René Schoof - 2008
unknown title – unknown authors - 2004
26 Open Problems in Number Theoretic Complexity, II – Leonard M. Adleman, Kevin S. Mccurley
1 The Pseudosquares Prime Sieve – Jonathan P. Sorenson
Breaking a Cryptographic Protocol with – Daniel Bleichenbacher
6 Towards a deterministic polynomial-time Primality Test – Neeraj Kayal, Nitin Saxena, Supervisor Dr. Manindra Agarwal - 2002
1 Efficient Algorithms for Computing the Jacobi Symbol (Extended Abstract) – Shawna M. Meyer, Jonathan P. Sorenson - 1998
18 The Carmichael Numbers up to 10^15 – R.G.E. Pinch - 1992
ABSOLUTE QUADRATIC PSEUDOPRIMES – Richard G. E. Pinch
NOTES ON SOME NEW KINDS OF PSEUDOPRIMES – Zhenxiang Zhang
12 Automaticity II: Descriptional Complexity in the Unary Case – Carl Pomerance, John Michael Robson, Jeffrey Shallit - 1995
16 Some results on pseudosquares – R. F. Lukes, C. D. Patterson, H. C. Williams - 1996