A tale of two sieves

 Access to full text

 Full (PDF)

1. Adleman, L. M., Factoring numbers using singular integers, Proc. 23rd Annual ACM Sympos. Theory of Computing (STOC) 1991, 64–71. (1991) 
2. Alford, W. R., Pomerance, C., Implementing the self initializing quadratic sieve on a distributed network, In: Number Theoretic and Algebraic Methods in Computer Science, Proc. Internat. Moscow Conf., June–July 1993 (A. J. van der Poorten, I. Shparlinski, H. G. Zimmer, eds.), World Scientific 1995, 163–174. (1993) Zbl0939.11038MR1377748
3. Brillhart, J., Lehmer, D. H., Selfridge, J. L., Tuckerman, B., Jr., S. S. Wagstaff, Factorizations of $b^n\pm 1$, $b=2,3,5,6,7,10,11,12$, up to high powers, second ed., vol. 22, Contemp. Math., Amer. Math. Soc., Providence, RI 1988. (1988) MR0996414
4. Canfield, E. R., Erdős, P., Pomerance, C., On a problem of Oppenheim concerning “Factorisatio Numerorum”, J. Number Theory 17 (1983), 1–28. (1983) Zbl0513.10043MR0712964
5. Coppersmith, D., Modifications to the number field sieve, J. Cryptology 6 (1993), 169–180. (1993) Zbl0806.11071MR1233462
6. Coppersmith, D., Odlyzko, A. M., Schroeppel, R., Discrete logarithms in $GF\left(p\right)$, Algorithmica 1 (1986), 1–15. (1986) Zbl0631.12010MR0833115
7. Cowie, J., Dodson, B., Elkenbracht-Huizing, R. Marije, Lenstra, A. K., Montgomery, P. L., Zayer, J., A world wide number field sieve factoring record: On to $512$ bits, Advances in Cryptology – Asiacrypt ’96, to appear. Zbl1028.11500
8. Elkenbracht-Huizing, M., A multiple polynomial general number field sieve, In: Algorithmic Number Theory, Second Internat. Sympos., ANTS-II, to appear. Zbl0899.11060MR1446502
9. Gerver, J., Factoring large numbers with a quadratic sieve, Math. Comp. 41 (1983), 287–294. (1983) Zbl0527.10003MR0701639
10. Lenstra, A. K., Integer factoring, Preprint. Zbl0964.11057MR1758972
11. Lenstra, A. K., Lenstra, H. W., Jr., The development of the number field sieve, Lecture Notes in Math., vol. 1554, Springer-Verlag, Berlin, Heidelberg 1993. (1554) Zbl0777.00017MR1321216
12. Lenstra, A. K., Manasse, M. S., Factoring by electronic mail, In: Advances in Cryptology – Eurocrypt ’89 (J.-J. Quisquater, J. Vandewalle, eds.), Springer-Verlag, Berlin, Heidelberg 1990, 355–371. (1990) MR1083962
13. Jr., H. W. Lenstra, Elliptic curves and number theoretic algorithms, In: Proc. Internat. Congr. Math., Berkeley, CA, 1986, vol. 1 (A. M. Gleason, ed.), Amer. Math. Soc., Providence, RI 1987, 99–120. (1986) MR0934218
14. Montgomery, P. L., A block Lanczos algorithm for finding dependencies over $GF\left(2\right)$, In: Advances in Cryptology – Eurocrypt ’95 (L. C. Guillou, J.-J. Quisquater, eds.), Springer-Verlag, Berlin, Heidelberg 1995, 106–120. (1995) Zbl0973.11520MR1367513
15. Montgomery, P. L., Square roots of products of algebraic integers, In: Mathematics of Computation 1943-1993, Fifty Years of Computational Mathematics (W. Gautschi, ed.), Proc. Sympos. Appl. Math., vol. 48, Amer. Math. Soc., Providence, RI 1994, 567–571. (1943) MR1314892
16. Morrison, M. A., Brillhart, J., A method of factorization and the factorization of $F_7$, Math. Comp. 29 (1975), 183–205. (1975) Zbl0302.10010MR0371800
17. Odlyzko, A. M., The future of integer factorization, CryptoBytes (The technical newsletter of RSA Laboratories), 1 (1995) 2, 5–12. (1995) 
18. Pomerance, C., Cryptology and computational number theory, Proc. Sympos. Appl. Math., vol. 42, Amer. Math. Soc., Providence, RI 1990. (1990) Zbl0734.11072MR1095547
19. Pomerance, C., The number field sieve, In: Mathematics of Computation 1943-1993, Fifty Years of Computational Mathematics (W. Gautschi, ed.), Proc. Sympos. Appl. Math., vol. 48, Amer. Math. Soc., Providence, RI 1994, 465–480. (1943) Zbl0821.11064MR1314884
20. Pomerance, C., On the role of smooth numbers in number theoretic algorithms, In: Proc. Internat. Congr. Math., Zurich, Switzerland, 1994, vol. 1 (S. D. Chatterji, ed.), Birkhauser-Verlag, Basel 1995, 411–422. (1994) Zbl0854.11047MR1403941
21. Pomerance, C., Smith, J. W., Tuler, R., A pipeline architecture for factoring large integers with the quadratic sieve algorithm, SIAM J. Comput. 17 (1988), 387–403. (1988) Zbl0644.10002MR0935347
22. Schirokauer, O., Weber, D., Denny, T., Discrete logarithms: The effectiveness of the index calculus method, Algorithmic Number Theory, Second Internat. Sympos., ANTS-II, to appear. Zbl0895.11054MR1446523
23. Williams, H. C., Shallit, J. O., Factoring integers before computers, In: Mathematics of Computation 1943–1993, Fifty Years of Computational Mathematics (W. Gautschi, ed.), Proc. Sympos. Appl. Math. 48, Amer. Math. Soc., Providence, RI 1994, 481–531. (1943) Zbl0847.11002MR1314885