Virtual logarithms

DOI10.1016/J.JALGOR.2004.11.004MaRDI QIDQ5711730zbMATH OpenOpenAlexFDO

Authors Oliver Schirokauer

Publication date 8 December 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.11.004

zbMATH Keywords

discrete logarithmfinite fieldnumber field sieve

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Using number fields to compute logarithms in finite fields
• The Number Field Sieve in the Medium Prime Case
• The Special Function Field Sieve
• Computation of discrete logarithms in an arbitrary finite field

Cited in

(11)

• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Indiscreet logarithms in finite fields of small characteristic
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
• An experiment of number field sieve over \(\mathrm{GF}(p)\) of low Hamming weight characteristic
• scientific article; zbMATH DE number 3880393 (Why is no real title available?)
• scientific article; zbMATH DE number 1069251 (Why is no real title available?)
• Computation of a 768-bit prime field discrete logarithm
• Higher-dimensional sieving for the number field sieve algorithms
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
• Secure and Efficient Pairing at 256-Bit Security Level

This page was built for publication: Virtual logarithms

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