The Generation of Random Numbers That Are Probably Prime (1988)

Cached

Download Links

by Pierre Beauchemin , Gilles Brassard , Claude Crepeau , Claude Goutier , Carl Pomerance
Venue:Journal of Cryptology
Citations:22 - 0 self

Documents Related by Co-Citation

2689 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
107 On distinguishing prime numbers from composite numbers – L M Adleman, C Pomerance, R S Rumely - 1983
1107 A public key cryptosystem and a signature scheme based on discrete logarithms – T ElGamal - 1985
2890 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
69 Almost All Primes Can be Quickly Certified – Shafi Goldwasser, Joe Kilian
33 Average case error estimates for the strong probable prime test – P Landrock, C Pomerance
829 How To Prove Yourself: Practical Solutions to Identification and Signature Problems – Amos Fiat, Adi Shamir - 1987
17 The Puzzle Palace – J Bamford - 1982
112 An efficient probabilistic public-key encryption scheme which hides all partial information – M Blum, S Goldwasser - 1985
43 Cryptanalysis: a survey of recent results – E F BRICKELL, A ODLYZKO - 1988
335 Differential Cryptanalysis of the Data Encryption Standard – E Biham, A Shamir - 1993
53 The First Ten Years of Public-Key Cryptography – W Diffie - 1988
190 A probabilistic algorithm for testing primality – Michael Rabin - 1980
33 Primality testing and Jacobi sums – H Cohen, H W Lenstra - 1984
26 Implementation of a new primality test – H Cohen, A K Lenstra - 1987
14 An Introduction to Fast Generation of Large Prime Numbers – C Couvreur, J-J Quisquater - 1983
145 A Proposal for a New Block Encryption Standard – Xuejia Lai, James L. Massey - 1991
1170 Probabilistic encryption – S Goldwasser, S Micali - 1984
147 Hiding information and signatures in trapdoor knapsacks – Ralph C. Merkle, Student Member, Ieee, Martin E. Hellman, Senior Member - 1978