Using number fields to compute logarithms in finite fields

DOI10.1090/S0025-5718-99-01137-0zbMath1042.11085OpenAlexW1969613838MaRDI QIDQ4955874

Oliver Schirokauer

Publication date: 22 May 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01137-0

Mathematics Subject Classification ID

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

Related Items

A comparison of MNT curves and supersingular curves ⋮ Individual discrete logarithm with sublattice reduction ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ On the signature calculus for finite fields of order square of prime numbers ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ Comparing two pairing-based aggregate signature schemes ⋮ Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Refined analysis to the extended tower number field sieve ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ A Brief History of Pairings ⋮ The multiple number field sieve for medium- and high-characteristic finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Modifications to the number field sieve
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Solving sparse linear equations over finite fields
• Factoring with Cyclotomic Polynomials
• Searching for Primitive Roots in Finite Fields
• Algorithms in Algebraic Number Theory
• Discrete logarithms and local units
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Special Function Field Sieve
• Constructing nonresidues in finite fields and the extended Riemann hypothesis
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve