An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates (2001)

by Ivan Bjerre Damgård , Gudmund Skovbjerg Frandsen
Citations:4 - 0 self

Documents Related by Co-Citation

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
14 On Generation of Probable Primes by Incremental Search – Jørgen Brandt, Ivan Damgard - 1992
8 Speeding up prime number generation – J Brandt, I Damg˚ard, P Landrock - 1991
33 Average case error estimates for the strong probable prime test – I Damg˚ard, P Landrock, C Pomerance - 1993
253 Selecting Cryptographic Key Sizes – Arjen K. Lenstra, Eric R. Verheul - 2001
11 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
8 Experiments with relaxation algorithms breaking simple substitution ciphers – D G N Hunter, A R McKenzie - 1983
5 On primality tests – D J Lehmann
25 Breaking substitution ciphers using a relaxation algorithm – S Peleg, A Rosenfeld - 1979
30 A Cautionary Note Regarding Evaluation of AES Candidates on Smart-Cards – Suresh Chari, Charanjit Jutla, Josyula R. Rao, Pankaj Rohatgi
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
665 Differential Power Analysis – Paul Kocher, Joshua Jaffe, Benjamin Jun - 1999
20 On the distribution of pseudoprimes – C Pomerance - 1981
20 Evaluation and comparison of two efficient probabilistic primality testing algorithms – L Monier - 1980
192 A probabilistic algorithm for testing primality – Michael Rabin - 1980
1 The Art of Programming Design, Volume 1: Fundamental Algorithms – D Knuth, ed - 1968