Efficient Generation of Prime Numbers (2000)

by Marc Joye , Pascal Paillier , Serge Vaudenay
Citations:12 - 4 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
14 On Generation of Probable Primes by Incremental Search – Jørgen Brandt, Ivan Damgard - 1992
3 Constructive Methods for the Generation of Prime Numbers – Marc Joye, Pascal Paillier - 2001
14 On the distribution of primes in short intervals – P X Gallagher - 1976
8 Fast Generation Of Random, Strong RSA Primes – Robert D. Silverman - 1997
8 Speeding up prime number generation – J Brandt, I Damg˚ard, P Landrock - 1991
328 The exact security of digital signatures: How to sign with RSA and Rabin – Mihir Bellare, Phillip Rogaway - 1996
238 Optimal Asymmetric Encryption – Mihir Bellare, Phillip Rogaway - 1994
73 Fast decipherment algorithm for RSA publickey cryptosystem – J-J Quisquater, C Couvreur - 1982
133 Some problems of ‘Partitio Numerorum’ III: On the expression of a number as a sum of primes – G H Hardy, J E Littlewood - 1922
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
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
260 The Art of Computer Programming: Seminumerical Algorithms, Addison-Wesley, third edition – D E Knuth - 1998