Cryptography and Coding

DOI10.1007/B93924MaRDI QIDQ5428162zbMATH OpenOpenAlexFDO

Authors Robert Granger

Publication date 28 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b93924

Mathematics Subject Classification ID

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

Recommendations

• On the discrete logarithm problem in finite fields of fixed characteristic
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• Indiscreet logarithms in finite fields of small characteristic
• A note on discrete logarithms in finite fields
• scientific article; zbMATH DE number 2127885
• scientific article; zbMATH DE number 1210375
• Computation of discrete logarithms in an arbitrary finite field
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

Cited in

(7)

• Computing small discrete logarithms faster
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• scientific article; zbMATH DE number 2127885 (Why is no real title available?)
• scientific article; zbMATH DE number 2086903 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Algorithmic Number Theory
• A new perspective on the powers of two descent for discrete logarithms in finite fields

This page was built for publication: Cryptography and Coding

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