The index calculus method using non-smooth polynomials

Authors:
Theodoulos Garefalakis and Daniel Panario

Journal:
Math. Comp. **70** (2001), 1253-1264

MSC (2000):
Primary 11Y16, 12E05; Secondary 11T71, 68P25, 68Q25, 94A60

DOI:
https://doi.org/10.1090/S0025-5718-01-01298-4

Published electronically:
March 7, 2001

MathSciNet review:
1826581

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

We study a generalized version of the index calculus method for the discrete logarithm problem in , when , is a small prime and . The database consists of the logarithms of all irreducible polynomials of degree between given bounds; the original version of the algorithm uses lower bound equal to one. We show theoretically that the algorithm has the same asymptotic running time as the original version. The analysis shows that the best upper limit for the interval coincides with the one for the original version. The lower limit for the interval remains a free variable of the process. We provide experimental results that indicate practical values for that bound. We also give heuristic arguments for the running time of the Waterloo variant and of the Coppersmith method with our generalized database.

**1.**I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone.

Computing logarithms in finite fields of characteristic two.*SIAM J. Alg. Disc. Meth.*, 5:276-285, 1984. MR**86h:11109****2.**M. Blum and S. Micali.

How to generate cryptographically strong sequences of pseudorandom bits.*SIAM J. Comput.*, 13:850-864, 1984. MR**86a:68021****3.**J. Buchmann and S. Düllmann.

On the computation of discrete logarithms in class groups.

In A.J. Menezes and S.A. Vanstone, editors,*Advances in Cryptology - CRYPTO '90*, volume 537 of*Lecture Notes in Computer Science*, pages 134-139. Springer, 1991. MR**94b:94002****4.**D. Coppersmith.

Fast evaluation of logarithms in fields of characteristic two.*IEEE Trans. Info. Theory*, 30:587-594, 1984. MR**85h:65041****5.**W. Diffie and M. Hellman.

New directions in cryptography.*IEEE Trans. Inform. Theory*, 22:644-654, 1976. MR**55:10141****6.**T. ElGamal.

A public key cryptosystem and a signature scheme based on discrete logarithms.*IEEE Trans. Info. Theory*, 31:469-472, 1985. MR**86i:94045****7.**S. Gao, J. Howell, and D. Panario.

Irreducible polynomials of given forms.

In R.C. Mullin and G.L. Mullen, editors,*Finite fields: theory, applications and algorithms*, volume 225, pages 43-54. Contemporary Mathematics, Amer. Math. Soc., 1999. MR**99g:11143****8.**S. Gao, J. von zur Gathen, and D. Panario.

Gauss periods: orders and cryptographical applications.*Math. Comp.*, 67:343-352, 1998. MR**98c:11134****9.**T. Garefalakis and D. Panario.

Polynomials over finite fields free from large and small degree irreducible factors. Submitted, 1999.**10.**J. von zur Gathen and D. Panario.

A survey on factoring polynomials over finite fields.

To appear in*J. Symb. Comp.*, 2000.**11.**R. Lidl and H. Niederreiter.*Finite fields*, volume 20 of*Encyclopedia of Mathematics and its Applications*.

Addison-Wesley, 1983. MR**86c:11106****12.**R. Lovorn.*Rigourous, subexponential algorithms for discrete logarithms over finite fields*.

PhD thesis, University of Georgia, 1992.**13.**R. Lovorn Bender and C. Pomerance.

Rigourous discrete logarithm computations in finite fields via smooth polynomials.

In*Computational Perspectives on Number Theory Proc. of a Conference in Honor of A.O.L. Atkin*, volume 7 of*AMS/International Press Studies in Advanced Mathematics*, Providence, 1998, pages 221-232. MR**99c:11156****14.**A. J. Menezes.*Elliptic Curve Public Key Cryptosystems*.

Kluwer Academic Publishers, Boston, Dordrecht, Lancaster, 1993. MR**2000d:94023****15.**V. Müller, A. Stein, and C. Thiel.

Computing discrete logarithms in real quadratic congruence function fields of large genus.*Math. Comp.*, 68:807-822, 1999. MR**99i:11119****16.**A. Odlyzko.

Discrete logarithms and their cryptographic significance.

In*Advances in Cryptology, Proceedings of Eurocrypt 1984*, volume 209 of*Lecture Notes in Computer Science*, pages 224-314. Springer-Verlag, 1985. MR**87g:11022****17.**A. Odlyzko.

Discrete logarithms and smooth polynomials.

In G.L. Mullen and P. J.-S. Shiue, editors,*Finite fields: theory, applications and algorithms*, pages 269-278. Contemporary Mathematics 168, Amer. Math. Soc., 1994. MR**95f:11107****18.**D. Wiedemann.

Solving sparse linear equations over finite fields.*IEEE Trans. Inf. Theory*, 32:54-62, 1986. MR**87g:11166**

Retrieve articles in *Mathematics of Computation*
with MSC (2000):
11Y16,
12E05,
11T71,
68P25,
68Q25,
94A60

Retrieve articles in all journals with MSC (2000): 11Y16, 12E05, 11T71, 68P25, 68Q25, 94A60

Additional Information

**Theodoulos Garefalakis**

Affiliation:
Department of Computer Science, University of Toronto, Toronto, M5S 3G4, Canada

Email:
theo@cs.toronto.edu

**Daniel Panario**

Affiliation:
School of Mathematics and Statistics, Carleton University, Ottawa, K1S 5B6, Canada

Email:
daniel@math.carleton.ca

DOI:
https://doi.org/10.1090/S0025-5718-01-01298-4

Keywords:
Finite fields,
discrete logarithm problem,
cryptography,
smooth polynomials

Received by editor(s):
May 24, 1999

Published electronically:
March 7, 2001

Additional Notes:
Work done while the second author was with the Department of Computer Science, University of Toronto.

Article copyright:
© Copyright 2001
American Mathematical Society