Indiscreet discrete logarithms

MaRDI QIDQ4602282zbMATH OpenFDO

Authors Robert Granger

Publication date 9 January 2018

Full work available at URL http://www.nieuwarchief.nl/serie5/pdf/naw5-2017-18-3-176.pdf

zbMATH Keywords

discrete logarithm problem (DLP)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Indiscreet logarithms in finite fields of small characteristic
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
• Computing discrete logarithms
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields

Cited in

(2)

• scientific article; zbMATH DE number 1722682 (Why is no real title available?)
• scientific article; zbMATH DE number 1113850 (Why is no real title available?)

This page was built for publication: Indiscreet discrete logarithms

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