Simple backdoors for RSA key generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2612, Issue , 2003, Pages 403-416

  Crépeau, Claude ^a   Slakmon, Alain ^b  

^a MCGILL UNIVERSITY   (Canada)

^b Bois de Boulogne College   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BACKDOORS; KEY GENERATION; PRIVATE/PUBLIC; PUBLIC INFORMATION; THIRD PARTIES;

FACTORIZATION;

EID: 35048854557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_28     Document Type: Article

References (16)

1. D. BONEH AND G. DURFEE, Cryptanalysis of RSA with private key d less than no.292, Information Theory, IEEE Transactions on, 46 (2000), pp. 1339-1349.
2. D. BONEH, G. DURFEE, AND Y. FRANKEL, An attack on RSA given a small fraction of the private key bits, in Advances in Cryptology - AsiaCrypt '98, K. Ohta and D. Pei, eds., Berlin, 1998, Springer-Verlag, pp. 25-34. Lecture Notes in Computer Science Volume 1514.
3. D. COPPERSMITH, Finding a small root of a bivariate integer equation; factoring with high bits known, in Advances in Cryptology - EuroCrypt '96, U. Maurer, ed., Berlin, 1996, Springer-Verlag, pp. 178-189. Lecture Notes in Computer Science Volume 1070.
4. C. CRÉPEAU AND S. WONG, The RSA hidden small exponent method, in http : //crypto.cs.mcgill.ca/∼crepeau/RSA, 2001.
5. B. DE WEGER, Cryptanalysis of RSA with small prime difference, Applicable Algebra in Engineering, Communication and Computing, 13 (2002), pp. 17-28.
6. M. JOYE, P. PAILLIER, AND S. VAUDENAY, Efficient generation of prime numbers, in CHES 2000, Ç. K. Koç and C. Paar, eds., Berlin, 2000, Springer-Verlag, pp. 340-354. Lecture Notes in Computer Science Volume 1965.
7. A. K. LENSTRA, Generating RSA moduli with a predetermined portion, in Advances in Cryptology - AsiaCrypt '98, K. Ohta and D. Pei, eds., Berlin, 1998, Springer-Verlag, pp. 1-10. Lecture Notes in Computer Science Volume 1514.
8. G. L. MILLER, Riemann's hypothesis and tests for primality, J. Comput. System Sci., 13 (1976), pp. 300-317.
9. R. L. RIVEST AND A. SHAMIR, Efficient factoring based on partial information., in Advances in Cryptology - EuroCrypt '85, F. Pichler, ed., Berlin, 1985, Springer-Verlag, pp. 31-34. Lecture Notes in Computer Science Volume 219.
10. R. L. RIVEST, A. SHAMIR, AND L. M. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), pp. 120-126.
11. A. SLAKMON, Sur des méthodes et algorithmes de factorisation et leur application en cryptologie, Master's thesis, Université de Montréal, dépt. IRO, 2000.
12. S. VAUDENAY, Private e-mail communication., 2 may 2001.
13. M. WIENER, Cryptanalysis of short RSA secret exponents, Information Theory, IEEE Transactions on, 36 (1990), pp. 553-558.
14. A. YOUNG AND M. YUNG, The dark side of "black-box" cryptography, or: Should we trust Capstone?, in Advances in Cryptology - Crypto '96, N. Koblitz, ed., Berlin, 1996, Springer-Verlag, pp. 89-103. Lecture Notes in Computer Science Volume 1109.
15. _, Kleptography: Using cryptography against cryptography, in Advances in Cryptology - EuroCrypt '97, W. Fumy, ed., Berlin, 1997, Springer-Verlag, pp. 62-74. Lecture Notes in Computer Science Volume 1233.
16. _, The prevalence of kleptographic attacks on discrete-log based cryptosystems, in Advances in Cryptology - Crypto '97, B. Kaliski, ed., Berlin, 1997, Springer-Verlag, pp. 264-276. Lecture Notes in Computer Science Volume 1294.