|
12
|
On Generation of Probable Primes by Incremental Search
– Jørgen Brandt, Ivan Damgard
- 1992
|
|
7
|
Speeding up prime number generation
– BDL91 Jørgen Brandt, Ivan Damg˚ard, Peter Landrock
- 1991
|
|
3
|
A probable prime test with very high con dence for n = 1 mod 4
– Siguna Müller
|
|
3
|
Further investigations with the strong probable prime test
– Ronald Joseph Burthe
- 1996
|
|
28
|
Average Case Error Estimates for the Strong Probable Prime Test
– I Damgard, P Landrock, C Pomerance, C
- 1993
|
|
205
|
Selecting Cryptographic Key Sizes
– Arjen K. Lenstra, Eric R. Verheul
- 2001
|
|
10
|
A Probable Prime Test With High Confidence
– Jon Grantham
|
|
3
|
Evaluation and Comparison of two e cient probabilistic primality testing algorithms
– Louis Monier
- 1980
|
|
2
|
Generating strong primes
– J Shawe-Taylor
- 1986
|
|
26
|
A Cautionary Note Regarding Evaluation of AES Candidates on Smart-Cards
– Suresh Chari, Charanjit Jutla, Josyula R. Rao, Pankaj Rohatgi
|
|
20
|
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
– Ueli M. Maurer
- 1995
|
|
4
|
On primality tests
– D J Lehmann
- 1979
|
|
7
|
Experiments with relaxation algorithms for breaking simple substitution ciphers
– D G N Hunter, A R McKenzie
- 1983
|
|
23
|
Breaking substitution ciphers using a relaxation algorithm
– S Peleg, A Rosenfeld
- 1979
|
|
496
|
Differential Power Analysis
– Paul Kocher, Joshua Jaffe, Benjamin Jun
- 1999
|
|
20
|
On the Distribution of Pseudoprimes
– Carl Pomerance
- 1981
|
|
18
|
Evaluation and comparison of two efficient probabilistic primality testing algorithms", Theoret
– L Monier
- 1980
|
|
163
|
Probabilistic algorithm for testing primality
– Michael Rabin
- 1980
|
|
1
|
The Art of Programming Design, Volume 1: Fundamental Algorithms
– D Knuth, ed
- 1968
|
