On the bounded sum-of-digits discrete logarithm problem in finite fields

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1432-1442

  Cheng, Qi ^a  

^a University of Oklahoma   (United States)

Author keywords

Discrete logarithm problem; Finite fields; Parameterized complexity; Sum of digits

Indexed keywords

DISCRETE LOGARITHM PROBLEM; FINITE FIELDS; PARAMETERIZED COMPLEXITY; SUM-OF-DIGITS;

ALGORITHMIC LANGUAGES; COMPUTABILITY AND DECIDABILITY; FUNCTIONS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 29344454314     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704446037     Document Type: Article

References (20)

1. L. M. ADLEMAN, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, in Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, 1979, pp. 55-60.
2. G. B. AGNEW, R. C. MULLIN, I. M. ONYSZCHUK, AND S. A. VANSTONE, An implementation for a fast public-key cryptosystem, J. Cryptology, 3 (1991), pp. 63-79.
3. E. BACH AND J. SHALLIT, Algorithmic Number Theory, vol. I, The MIT Press, Cambridge, MA, 1996.
4. D. J. BERNSTEIN, Proving Primality in Essentially Quartic Random Time, http://cr.yp.to/papers.html#quartic, 2003. Math. Comp., to appear.
5. D. J. BERNSTEIN, Sharper ABC-based Bounds for Congruent Polynomials, http://cr.yp.to/papers.html#abccong, 2003. Journal de Theor. Nombres Bordeaux, to appear.
6. P. BERRIZBEITIA, Sharpening "Primes Is in P" for a Large Family of Numbers, http://lanl. arxiv.org/abs/math.NT/0211334, 2002. Math. Comp., to appear.
7. Q. CHENG, Primality proving via one round in ECPP and one iteration in AKS, in Proceedings of the 23rd Annual International Cryptology Conference (CRYPTO), Lecture Notes in Comput. Sci. 2729, D. Boneh, ed., Springer-Verlag, Berlin, 2003, pp. 338-348.
8. Q. CHENG, Constructing finite field extensions with large order elements, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2004, pp. 1123-1124.
9. Q. CHENG, K. VUCHI, AND Y.-H. LI, On the Size of the Subgroup Generated by Linear Factors, manuscript, 2004.
10. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
11. M. FELLOWS AND N. KOBLITZ, Fixed-parameter complexity and cryptography, in Proceedings of the Tenth International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC '93), Lecture Notes in Comput. Sci. 673, Springer-Verlag, Berlin, 1993, pp. 121-131.
12. S. GAO, Normal Bases over Finite Fields, Ph.D. thesis, The University of Waterloo, Ontario, Canada, 1993.
13. V. GURUSWAMI AND M. SUDAN, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Trans. Inform. Theory, 45 (1999), pp. 1757-1767.
14. A. M. ODLYZKO, Discrete logarithms: The past and the future, Des. Codes Cryptogr., 19 (2000), pp. 129-145.
15. R. A. RUEPPEL, Advances in Cryptology - EUROCRYPT '92, Proceedings of the Workshop on Theory and Application of Cryptographic Techniques, Lecture Notes in Comput. Sci. 658, Springer-Verlag, Berlin, 1993.
16. C. P. SCHNORR, Efficient signature generation by smart cards, J. Cryptology, 4 (1991), pp. 161-174.
17. D. R. STINSON, Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem, Math. Comp., 71 (2002), pp. 379-391.
18. J. F. VOLOCH, On some subgroups of the multiplicative group of finite rings, J. Théor. Nombres Bordeaux, 16 (2004), pp. 233-239.
19. J. VON ZUR GATHEN, Efficient exponentiation in finite fields, in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan, PR, 1991, pp. 384-391.
20. A. E. WESTERN AND J. C. P. MILLER, Tables of Indices and Primitive Roots, Vol. 9, Cambridge University Press, London, 1968.