|
2
|
Carmichael Numbers of the form (6m + 1)(12m + 1)(18m + 1)
– Harvey Dubner
- 2002
|
|
8
|
Nagaraj, Density of Carmichael numbers with three prime factors
– R. Balasubramanian, S. V. Nagaraj
|
|
3
|
Some Primality Testing Algorithms
– R.G.E. Pinch
- 1993
|
|
20
|
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
– Ueli M. Maurer
- 1995
|
|
|
Positive Integers n Such That σ(φ(n)) = σ(n)
– Jean-marie De Koninck, Florian Luca, Morelia Michoacán
- 2008
|
|
|
Theorem
– D. R. Heath-brown
|
|
|
Typeset by A S-T X RABINOWITSCH REVISITED
– Andrew Granville, Richard A. Mollin
|
|
2
|
Reciprocals of certain large additive functions
– P Erdős, A Ivic
- 1981
|
|
|
Notes by G.J.O. Jameson
– unknown authors
|
|
|
unknown title
– unknown authors
- 711
|
|
16
|
The Carmichael Numbers up to 10^15
– R.G.E. Pinch
- 1992
|
|
5
|
Finding Four Million Large Random Primes
– Ronald L. Rivest
|
|
17
|
Fully distributed threshold RSA under standard assumptions
– Pierre-Alain Fouque, Jacques Stern
- 2001
|
|
7
|
The distribution of Lucas and elliptic pseudoprimes
– Daniel M. Gordon, et al.
- 2001
|
|
2
|
Integer Factoring
– Arjen K. Lenstra
- 2000
|
|
2
|
On using Carmichael numbers for public key encryption systems
– R.G.E. Pinch
- 1997
|
|
|
unknown title
– unknown authors
|
|
9
|
Security analysis of the gennaro-halevi-rabin signature scheme
– Jean-sébastien Coron, David Naccache, Ecole Normale, Supérieure Gemplus, Card International
- 2000
|
|
|
The Carmichael numbers up to 10 20
– Richard G. E. Pinch
|
