The magic words are squeamish ossifrage

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

Volumn 917, Issue , 1995, Pages 260-277

  Atkins, Derek ^a   Graft, Michael ^b   Lenstra, Arjen K ^c   Leyland, Paul C ^d  

^a 12 Rindge Avenue ^*  (United States)

^b IOWA STATE UNIVERSITY   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

COMPUTATIONAL POWER; QUADRATIC FUNCTION; QUADRATIC SIEVE; RSA MODULI; TIME SPENT;

COMPUTATION THEORY;

EID: 84955575947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (24)

1. D. J. Bernstein, A. K. Lenstra, A general number field sieve implementation, 103126 in: [13].
2. 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.
3. J. D. Dixon, Asymptotically fast factorization of integers, Math. Comp. 36 (1981) 255-260.
4. B. Dixon, A. K. Lenstra, Factoring integers using SIMD sieves, Advances in Cryp-tology, Eurocrypt '93, Lecture Notes in Comput. Sci. 765 (1994) 28-39.
5. B. Dodson, A. K. Lenstra, NFS with four large primes: an explosive experiment, in preparation.
6. M. Gardner, Mathematical games, A new kind of cipher that would take millions of years to break, Scientific American, August 1977,120-124.
7. R. Golliver, A. K. Lenstra, K. S. McCurley, Lattice sieving and trial division, Algorithmic number theory symposium, Lecture Notes in Comput. Sci. 877 (1994) 18-27.
8. R. K. Guy, How to factor a number, Proc. Fifth Manitoba Conf. Numer. Math., Congressus Numerantium 16 (1976) 49-89.
9. D. E. Knuth, The art of computer programming, volume 2, Seminumerical algorithms, second edition, Addison-Wesley, Reading, Massachusetts, 1981.
10. B. A. LaMacchia, A. M. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes and Cryptography 1 (1991) 47-62.
11. A. K. Lenstra, Massively parallel computing and factoring, Proceedings Latin'92, Lecture Notes in Comput. Sci. 583 (1992) 344-355.
12. 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.
13. A. K. Lenstra, H. W. Lenstra, Jr. (eds), The development of the number field sieve, Lecture Notes in Math. 1554, Springer-Verlag, Berlin, 1993.
14. A. K. Lenstra, H. W. Lenstra, Jr.M.S. Manasse, J. M. Pollard, The factorization of the ninth Fermat number, Math.Comp 61 (1993) 319-349.
15. A. K. Lenstra, M. S. Manasse, Factoring by electronic mail, Advances in Cryptol-ogy, Eurocrypt '89, Lecture Notes in Comput. Sci. 434 (1990) 355-371.
16. A. K. Lenstra, M.S. Manasse, Factoring with two large primes, Advances in Cryp-tology, Eurocrypt '90, Lecture Notes in Comput. Sci. 473 (1990) 72-82; Math. Comp., to appear.
17. U. M. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters, Journal of Cryptology, to appear.
18. C. Pomerance, Analysis and comparison of some integer factoring algorithms, pp. 89-139 in: H. W. Lenstra, Jr., R. Tijdeman (eds), Computational methods in number theory, Math. Centre Tracts 154/155, Mathematisch Centrum, Amsterdam, 1983.
19. C. Pomerance, J. W. Smith, Reduction of huge, sparse matrices over finite fields via created catastrophes, Experiment. Math. 1 (1992) 89-94.
20. R. L. Rivest, letter to Martin Gardner, 1977.
21. R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM 21 (1978) 120-126.
22. R. C. Schroeppel, personal communication, May 1994.
23. A. Shamir, personal communication, April 1994.
24. R. D. Silverman, The multiple polynomial quadratic sieve, Math. Comp. 48 (1987) 329-339.