Using number fields to compute logarithms in finite fields

DOI10.1090/S0025-5718-99-01137-0zbMATH Open1042.11085OpenAlexW1969613838MaRDI QIDQ4955874FDOQ4955874

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5532108
• The Number Field Sieve in the Medium Prime Case
• On Computing Logarithms Over Finite Fields
• Computation of discrete logarithms in an arbitrary finite field
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• The Number Field Sieve in the Medium Prime Case
• On the signature calculus for finite fields of order square of prime numbers
• Secure and Efficient Pairing at 256-Bit Security Level
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Updating key size estimations for pairings
• Extended tower number field sieve: a new complexity for the medium prime case
• A comparison of MNT curves and supersingular curves
• The Special Function Field Sieve
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
• The multiple number field sieve for medium- and high-characteristic finite fields
• Individual discrete logarithm with sublattice reduction
• A brief history of pairings
• Virtual logarithms
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• On Computing Logarithms Over Finite Fields
• Comparing two pairing-based aggregate signature schemes
• Refined analysis to the extended tower number field sieve
• A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
• Indiscreet logarithms in finite fields of small characteristic
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

This page was built for publication: Using number fields to compute logarithms in finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955874)