A world wide number field sieve factoring record: On to 512 bits

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

Volumn 1163, Issue , 1996, Pages 382-394

  Cowie, James ^a   Dodson, Bruce ^b   Elkenbracht Huizing, R Marije ^c   Lenstra, Arjen K ^d   Montgomery, Peter L ^e   Zayer, Jörg ^e  

^a Cooperating Systems Corporation ^*  (United States)

^b LEHIGH UNIVERSITY   (United States)

^c CWI   (Netherlands)

^d Citibank NA   (United States)

^e NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

COMPUTER TIME; NUMBER FIELD SIEVE; PUBLIC KEY CRYPTOSYSTEMS; QUADRATIC SIEVE;

SIEVES;

EID: 84955611255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034863     Document Type: Conference Paper

References (18)

1. D. Atkins, M. Graff, A. K. Lenstra, and P. O. Leyland, THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE, Advances in Cryptology, Asiacrypt'94, Lecture Notes in Comput. Sci. 917 (1995), 265-277.
2. D. J. Bernstein, A. K. Lenstra, A general number field sieve implementation, 103126 in: [12].
3. J. Buchmann, J. Loho, J. Zayer, An implementation of the general number fìeld sieve, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci. 773 (1994) 159-165.
4. T. Denny, B. Dodson, A. K. Lenstra, M. S. Manasse, On the factorization of RSA-120, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci. 773 (1994) 166-174.
5. B. Dixon, A. K. Lenstra, Factoring integers using SIMD sieves, Advances in Cryptology, Eurocrypt '93, Lecture Notes in Comput. Sci. 765 (1994) 28-39.
6. B. Dodson, A. K. Lenstra, NFS with four large primes: an explosive experiment, Advances in Cryptology, Crypto '95, Lecture Notes in Comput. Sci. 963 (1995) 372-385.
7. R. M. Elkenbracht-Huizing, An implementation of the number field sieve, Technical Report NM-R9511, Centrum voor Wiskunde en Informatica, Amsterdam, 1995; to appear in Experimental Mathematics.
8. R. M. Elkenbracht-Huizing, A multiple polynomial general number field sieve, Proceedings ANTS II, to appear.
9. M. Gardner, Mathematical games, A new kind of cipher that would take millions of years to break, Scientific American, August 1977, 120-124.
10. R. Golliver, A. K. Lenstra, K. McCurley, Lattice sieving and trial division, ANTS '94, Lecture Notes in Comput. Sci. 877 (1994) 18-27.
11. A. K. Lenstra, H. W. Lenstra, Jr., Algorithms in number theory, Chapter 12 in: J. van Leeuwen (ed.), Handbook of theoretical computer science, Volume A, Algorithms and complexity, Elsevier, Amsterdam, 1990.
12. A. K. Lenstra, H. W. Lenstra, Jr. (eds), The development of the number field sieve, Lecture Notes in Math. 1554, Springer-Verlag, Berlin, 1993.
13. A. K. Lenstra, M. S. Manasse, Factoring by electronic mail, Advances in Cryptology, Eurocrypt '89, Lecture Notes in Comput. Sci. 434 (1990) 355-371.
14. A. K. Lenstra, M. S. Manasse, Factoring with two large primes, Advances in Cryptology, Eurocrypt '90, Lecture Notes in Comput. Sci. 473 (1991) 72-82; Math. Comp., 63 (1994) 785-798.
15. P. L. Montgomery, Square roots of products of algebraic numbers, Proceedings of Symposia in Applied Mathematics, Mathematics of Computation 1943-1993, Vancouver, 1993, Walter Gautschi, ed.
16. P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in Cryptology, Eurocrypt'95, Lecture Notes in Comput. Sci. 921 (1995) 106-120.
17. J. M. Pollard, The lattice sieve, 43-49 in: [12].
18. RSA Data Security Corporation Inc., sci. crypt, May 18, 1991; information available by sending electronic mail to challenge-rsa-listbrsa. com.