On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages

Scientific paper

In this paper, we study the discrete logarithm problem in the finite fields $\F_{q^n}$ where $n|q-1$. The field is called a Kummer field or a Kummer extension of $\F_q$. It plays an important role in improving the AKS primality proving algorithm. It is known that we can efficiently construct an element $g$ with order greater than $2^n$ in the fields. Let $S_q(\bullet)$ be the function from integers to the sum of digits in their $q$-ary expansions. We present an algorithm that given $g^e$ ($ 0\leq 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 $. The main tool for the latter result is the Guruswami-Sudan list decoding algorithm. Built on these results, we prove that in the field $\F_{q^{q-1}}$, the bounded sum-of-digits discrete logarithm with respect to $g$ can be computed in random time $O(f(w) \log^4 (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 extendible to Artin-Schreier extension $\F_{p^p}$ where $p$ is a prime. Since every finite field has an extension of reasonable degree which is a Kummer field, 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-604088

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.