A. K. Lenstra
- 1 Red Alford, C. Pomerance, personal communication.Google Scholar
- 2 J. Brillhart, D.H. Lehmer, J.L. Selfridge, B. Tuckerman, S.S. Wagstaff, Jr., Factorizations of bn
±1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, second edition, Contemporary Mathematics, vol. 22, Providence: A.M.S., 1988.Google Scholar
- 3 J. Buhler, H.W. Lenstra, Jr., C. Pomerance, in preparation.Google Scholar
- 4 T.R. Caron, R.D. Silverman, "Parallel implementation of the quadratic sieve," J. Supercomputing, v. 1, 1988, pp. 273-290.Google ScholarCross Ref
- 5 D. Coppersmith, A.M. Odlyzko, R. Schroeppel, "Discrete Logarithms in GF(p)," Algorithmica, v. 1, 1986, pp. 1-15. Google ScholarDigital Library
- 6 D.E. Knuth, "Computer Science and its relation to mathematics," Amer. Math. Monthly, v. 81, 1974, pp. 323-342.Google ScholarCross Ref
- 7 D.E. Knuth, The art of computer programming, vol. 2, Seminumerical algorithms, second edition, Addison-Wesley, Reading 1981. Google ScholarDigital Library
- 8 S. Lang, Algebra, second edition, Addison-Wesley, Reading, 1984.Google Scholar
- 9 A.K. Lenstra, H.W. Lenstra, Jr., "Algorithms in number theory," to appear in: J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, D. Perrin (eds), Handbook of theoretical computer science, North-Holland, Amsterdam. Google ScholarDigital Library
- 10 A.K. Lenstra, M.S. Manasse, "Factoring by electronic mail," Proceedings Eurocrypt '89, to appear. Google ScholarDigital Library
- 11 M.A. Morrison, J. Brillhart, "A method of factoring and the factorization of F
7," Math. Comp., v. 29, 1975, pp. 183-205.Google Scholar
- 12 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 1982.Google Scholar
- 13 C. Pomerance, S.S. Wagstaff, Jr., "Implementation of the continued fraction integer factoring algorithm," Congress. Numer., v. 37, 1983, pp. 99-118.Google Scholar
- 14 H.J.J. te Riele, W.M. Lioen, D.T. Winter, "Factoring with the quadratic sieve on large vector computers," report NM-R8805, 1988, Centrum voor Wiskunde en Informatica, Amsterdam.Google Scholar
- 15 I.N. Stewart, D.O. Tall, Algebraic number theory, second edition, Chapman and Hall, 1987.Google Scholar
- 16 D.H. Wiedemann, "Solving sparse linear equations over finite fields," IEEE Trans. Inform. Theory, IT- 32, 1986, pp. 54-62. Google ScholarDigital Library
Index Terms
- The number field sieve
Recommendations
The Special Function Field Sieve
Let p be a prime number and n a positive integer, and let q = p n . Adleman and Huang [ Inform. and Comput., 151 (1999), pp. 5--16] have described a version of the function field sieve which is conjectured to compute a logarithm in the field of ...
Improvements to the general number field sieve for discrete logarithms in prime fields: a comparison with the Gaussian integer method
In this paper, we describe many improvements to the number field sieve. Our main contribution consists of a new way to compute individual logarithms with the number field sieve without solving a very large linear system for each logarithm. We show that, ...
The number field sieve in the medium prime case
CRYPTO'06: Proceedings of the 26th annual international conference on Advances in CryptologyIn this paper, we study several variations of the number field sieve to compute discrete logarithms in finite fields of the form ${\mathbb F}_{p^n}$, with p a medium to large prime. We show that when n is not too large, this yields a $L_{p^n}(1/3)$ ...
Comments