Carmichael numbers and pseudoprimes Notes by G.J.O. Jameson

Cached

Download Links

by Unknown Authors

Active Bibliography

Notes by G.J.O. Jameson – unknown authors
16 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
unknown title – unknown authors
1 DIVISORS OF SHIFTED PRIMES – Dimitris Koukoulopoulos
2 On Generalized Carmichael Numbers – Lorenz Halbeisen, Norbert Hungerbühler - 2000
2 Building Pseudoprimes With A Large Number Of Prime Factors – D. Guillaume, F. Morain - 1995
On the Distribution of Carmichael Numbers – Aran Nayebi - 906
20 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent - 2006
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992
LEHMER’S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID – Jordan Schettler
1 ON THE EXISTENCE AND NON-EXISTENCE OF ELLIPTIC PSEUDOPRIMES – Siguna Müller
Abstract Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent
3 Smooth Orders and Cryptographic Applications – Carl Pomerance, Igor Shparlinski - 2002
10 It is easy to determine whether a given integer is prime – Andrew Granville - 2005
6 It Is Easy to Determine Whether a Given Integer Is – Andrew Granville - 2005
3 Primality Testing Revisited – J.H. Davenport - 1992
8 Nagaraj, Density of Carmichael numbers with three prime factors – R. Balasubramanian, S. V. Nagaraj