Modifications to the Number Field Sieve (original) (raw)

References

1. L. M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symposium on the Theory of Computing, 1991, pp. 64–71.
2. J. P. Buhler, H. W. Lenstra, Jr., and C. Pomerance, Factoring Integers with the Number Field Sieve, Springer-Verlag, Berlin, Lecture Notes in Mathematics, to appear.
3. E. R. Canfield, P. Erdös, and C. Pomerance, On a problem of Oppenheim concerning “Factorisatio Numerorum”, J. Number Theory 17 (1983), 1–28.
   Google Scholar
4. D. Coppersmith, Solving Linear Equations over GF(2) II: Block Wiedemann Algorithm, Research Report RC 17293, IBM T. J. Watson Research Center, Yorktown Heights, NY, 17 October 1991. To appear in Math. Comput.
   Google Scholar
5. N. G. de Bruijn, On the number of positive integers ≤x and free of prime factors >y, II, Nederl. Akad. Wetersch. Indag. Math. 38 (1966), 239–247.
   Google Scholar
6. H. W. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math. 126 (1987), 649–673.
   Google Scholar
7. A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, The number field sieve, Proc 22nd Annual ACM Symposium on the Theory of Computing, 1990, pp. 564–572.
8. C. Pomerance, Fast, rigorous factorization and discrete logarithm algorithms, in: D. S. Johnson, T. Nishizeki, A Nozaki, and H. S. Wilf (eds), Discrete Algorithms and Complexity, Academic Press, Orlando, FL, 1987, pp. 119–143.
   Google Scholar
9. C. P. Schnorr, Refined analysis and improvements on some factoring algorithms, J. Algorithms 3 (1982), 101–127.
   Google Scholar
10. D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory 32 (1986), 54–62.
    Google Scholar

Download references