On the discrete logarithm problem in finite fields of fixed characteristic

DOI10.1090/tran/7027zbMath1428.11210arXiv1507.01495OpenAlexW1684267317MaRDI QIDQ4604404

Robert Granger, Jens Zumbrägel, Thorsten Kleinjung

Publication date: 26 February 2018

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.01495

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (15)

Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Factor base discrete logarithms in Kummer extensions ⋮ Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ A new perspective on the powers of two descent for discrete logarithms in finite fields ⋮ Roots of certain polynomials over finite fields ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms ⋮ On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic ⋮ Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Refined analysis to the extended tower number field sieve ⋮ Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Cites Work

• Unnamed Item
• On \(x^{q+1}+ax+b\)
• \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
• \(3\)-designs from PGL\((2,q)\)
• Approximate formulas for some functions of prime numbers
• A general framework for subexponential discrete logarithm algorithms
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• Traps to the BGJT-algorithm for discrete logarithms
• Solving a $$6120$$ -bit DLP on a Desktop Computer
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• On the discrete logarithm problem in elliptic curves
• Finding Isomorphisms Between Finite Fields
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Generators and irreducible polynomials over finite fields
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: On the discrete logarithm problem in finite fields of fixed characteristic