Abstract
In this paper, we study the bounded sum-of-digits discrete logarithm problem in finite fields. Our results concern primarily with fields \({\mathbf F}_{q^n}\) where n|q–1. The fields are called Kummer extensions of F q . It is known that we can efficiently construct an element g with order greater than 2n in the fields. Let S q ( ∙ ) be the function from integers to the sum of digits in their q-ary expansions. We first present an algorithm that given g e ( 0≤ e < q n ) finds e in random polynomial time, provided that S q (e) < n. We then show that the problem is solvable in random polynomial time for most of the exponent e with S q (e) < 1.32 n , by exploring an interesting connection between the discrete logarithm problem and the problem of list decoding of Reed-Solomon codes, and applying the Guruswami-Sudan algorithm. As a side result, we obtain a sharper lower bound on the number of congruent polynomials generated by linear factors than the one based on Stothers-Mason ABC-theorem. We also prove that in the field \({\mathbf F}_{q^{q-1}}\), the bounded sum-of-digits discrete logarithm with respect to g can be computed in random time O(f(w) log4 (q q − − 1)), where f is a subexponential function and w is the bound on the q-ary sum-of-digits of the exponent, hence the problem is fixed parameter tractable. These results are shown to be generalized to Artin-Schreier extension \({\mathbf F}_{p^p}\) where p is a prime. Since every finite field has an extension of reasonable degree which is a Kummer extension, our result reveals an unexpected property of the discrete logarithm problem, namely, the bounded sum-of-digits discrete logarithm problem in any given finite field becomes polynomial time solvable in certain low degree extensions.
This research is partially supported by NSF Career Award CCR-0237845.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agnew, G.B., Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A.: An implementation for a fast public-key cryptosystem. Journal of Cryptology 3, 63–79 (1991)
Agrawal, M., Kayal, N., Saxena, N.: Primes is in P (2002), http://www.cse.iitk.ac.in/news/primality.pdf
Bach, E., Shallit, J.: Algorithmic Number theory, vol. I. The MIT Press, Cambridge (1996)
Bernstein, D.J.: Proving primality in essentially quartic random time (2003), http://cr.yp.to/papers/quartic.pdf
Bernstein, D.J.: Sharper ABC-based bounds for congruent polynomials (2003), http://cr.yp.to/
Pedro Berrizbeitia. Sharpening “primes is in p” for a large family of numbers (2002), http://lanl.arxiv.org/abs/math.NT/0211334
Cheng, Q.: Primality proving via one round in ECPP and one iteration in AKS. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 338–348. Springer, Heidelberg (2003)
Cheng, Q.: Constructing finite field extensions with large order elements. In: ACMSIAM Symposium on Discrete Algorithms (SODA) (2004)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Fellows, M., Koblitz, N.: Fixed-parameter complexity and cryptography. In: Moreno, O., Cohen, G., Mora, T. (eds.) AAECC 1993. LNCS, vol. 673, Springer, Heidelberg (1993)
Gao, S.: Normal Bases over Finite Fields. PhD thesis, The University of Waterloo (1993)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory 45(6), 1757–1767 (1999)
Odlyzko, M.: Discrete logarithms: The past and the future. Designs, Codes, and Cryptography 19, 129–145 (2000)
Stinson, D.R.: Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem. Math. Comp. 71, 379–391 (2002)
Voloch, J.F.: On some subgroups of the multiplicative group of finite rings (2003), http://www.ma.utexas.edu/users/voloch/preprint.html
von Gathen, J.Z.: Efficient exponentiation in finite fields. In: Proc. 32nd IEEE Symp. on Foundations of Comp. Science (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, Q. (2004). On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. In: Franklin, M. (eds) Advances in Cryptology – CRYPTO 2004. CRYPTO 2004. Lecture Notes in Computer Science, vol 3152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-28628-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22668-0
Online ISBN: 978-3-540-28628-8
eBook Packages: Springer Book Archive