Fast Generation Of Random, Strong RSA Primes (1997)

Cached

Download Links

by Robert D. Silverman
Citations:8 - 0 self

Documents Related by Co-Citation

2895 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
2453 Handbook of Applied Cryptography – Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest - 1997
12 Efficient Generation of Prime Numbers – Marc Joye, Pascal Paillier, Serge Vaudenay - 2000
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
40 A p +1 method of factoring – H C Williams - 1982
14 On Generation of Probable Primes by Incremental Search – Jørgen Brandt, Ivan Damgard - 1992
14 On the distribution of primes in short intervals – P X Gallagher - 1976
4 Implementation of the Goldwasser-Killian-Atkin Primality Testing Algorithm – F Morain - 1988
4 Primality Proving with Cyclotomy. Doctoral Dissertation – W Bosma - 1990
36 Factorization and Primality Testing – D M Bressoud - 1989
43 Multiuser cryptographic techniques – W Diffie, M E Hellman - 1976
2693 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
564 Cryptography and network security: Principles and practice. Upper Saddle River – W Stallings - 1999
260 The Art of Computer Programming: Seminumerical Algorithms, Addison-Wesley, third edition – D E Knuth - 1998
3 Security of number theoretic cryptosystems against random attacks – B Blakley, G B Blakley - 1978
4 Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages – G R Blakey, I Borosh - 1979
8 Strong RSA keys – J Gordon - 1984
2 On using Carmichael numbers for public key encryption systems – R.G.E. Pinch - 1997
6 Efficient cryptosystems over elliptic curves based on a product of formfree primes – K Koyama, H Kuwakado - 1994