Generating RSA moduli with a predetermined portion

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

Volumn 1514, Issue , 1998, Pages 1-10

  Lenstra, Arjen K ^a  

^a Citibank NA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SECURITY OF DATA;

COMPUTATIONAL REQUIREMENTS; RSA CRYPTOSYSTEMS; RSA MODULI;

CRYPTOGRAPHY;

EID: 84947730183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49649-1_1     Document Type: Conference Paper

References (20)

1. ANSI X9.31: American national standard for financial services - Digital signatures using reversible public key cryptography for the financial services industry (rDSA). Working draft (May 1998)
2. Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U. (ed.): Advances in Cryptology - Eurocrypt'96. Lecture Notes in Computer Science, Vol. 1070. Springer-Verlag, Berlin Heidelberg New York (1996) 178-189
3. Coppersmith, D.: Personal communication (1998)
4. Coppersmith, D., Odlyzko, A.M., Schroeppel, R.: Discrete logarithms in GF(p). Algorith-mica 1 (1986) 1-15
5. Cowie, J., Dodson, B., Elkenbracht-Huizing, R.M., Lenstra, A.K., Montgomery, P.L., Zayer, J.: A world wide number field sieve factoring record: on to 512 bits. In: Kim, K., Matsumoto, T. (eds.): Advances in Cryptology - Asiacrypt'96. Lecture Notes in Computer Science, Vol. 1163. Springer-Verlag, Berlin Heidelberg New York (1996) 382-394
6. Knuth, D.E.: The art of computer Programming, Vol. 2, Seminumerical algorithms, 2nd edn. Addison Wesley (1981)
7. Lenstra, A.K, Lenstra, H.W. (eds.): The development of the number field sieve. Lecture Notes in Mathematics, Vol. 1554. Springer-Verlag, Berlin Heidelberg New York (1993)
8. Lenstra, Jr., H.W.: Factoring integers using elliptic curves. Ann. of Math. 126 (1987) 649-673
9. Les Specifications et les Normes de la Carte a Memoire Bancaire, Groupement Carte a Memoire, 96 rue de la Victoire, 75009, Paris, Janvier 1984, chapitre 6: La Securite.
10. Montgomery, P.L.: Modular multiplication without trial division. Math. Comp. 44 (1985) 519-521
11. Morrison, M.A., Brillhart, J.: A method of factoring and the factorization of F7. Math. Comp. 29 (1975) 183-205
12. Naccache, D.: Personal communication (1998)
13. Naccache, D., M'Ra'ihi, A., Vaudenay, S., Raphaeli, D.: Can D.S.A. be improved? - Complexity trade-offs with the digital signature standard. In: DeSantis, A. (ed.): Advances in Cryptology - Eurocrypt'94. Lecture Notes in Computer Science, Vol. 950. Springer-Verlag, Berlin Heidelberg New York (1995) 77-85
14. Pomerance, C.: Analysis and comparison of some integer factoring algorithms. In: Lenstra, Jr., H.W., Tijdeman, R. (eds.): Computational methods in number theory. Math. Centre tracts 154/155. Math. Centrum, Amsterdam (1982) 89-139
15. Rivest, R.L, Silverman, R.D.: Are 'strong' primes needed for RSA?. In: RSA'98 conference binder.
16. Shamir, A.: Personal communication (1998)
17. Silverman, R.D.: Fast generation of random, strong RSA primes. RSA Laboratories' Cryptobytes 3, number 1, (1997) 9-13
18. Vanstone, S.A, Zuccherato, R.J.: Short RSA keys and their generation. Journal of Cryptology 8 (1995) 101-114
19. Young, A. Yung, M.: The dark side of „Black-Box" cryptography, or: should we trust Capstone? In: Koblitz, N. (ed.): Advances in Cryptology - Crypto'96. Lecture Notes in Computer Science, Vol. 1109. Springer-Verlag, Berlin Heidelberg New York (1996) 89-103
20. Zhang, M.: Factorization of the numbers of the form m3+c2m2+c1m+c0. In: Buhler, J.P. (ed.): Algorithmic Number Theory - ANTS-III. Lecture Notes in Computer Science, Vol. 1423. Springer-Verlag, Berlin Heidelberg New York (1998) 131-136