Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
A subexponential algorithm for discrete logarithms over all finite fields
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A course in computational algebraic number theory
A course in computational algebraic number theory
A Non-interactive Public-Key Distribution System
Designs, Codes and Cryptography
Function field sieve method for discrete logarithms over finite fields
Information and Computation
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Computing Discrete Logarithms with the General Number Field Sieve
ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Discrete Logarithms: The Effectiveness of the Index Calculus Method
ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
The Function Field Sieve Is Quite Special
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Journal of Algorithms
On the discrete logarithm problem on algebraic tori
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
The function field sieve in the medium prime case
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Applications to cryptography of twisting commutative algebraic groups
Discrete Applied Mathematics
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range
Information Sciences: an International Journal
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Complexity of decoding positive-rate primitive Reed-Solomon codes
IEEE Transactions on Information Theory
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Solving a 676-bit discrete logarithm problem in GF(36n)
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
A tutorial on high performance computing applied to cryptanalysis
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the minimal embedding field
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Factor-4 and 6 (de)compression for values of pairings using trace maps
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
| Hi-index | 0.06 |
In 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)$ algorithm with efficiency similar to that of the regular number field sieve over prime fields. This approach complements the recent results of Joux and Lercier on the function field sieve. Combining both results, we deduce that computing discrete logarithms have heuristic complexity $L_{p^n}(1/3)$ in all finite fields. To illustrate the efficiency of our algorithm, we computed discrete logarithms in a 120-digit finite field ${\mathbb F}_{p^3}$.