Cryptography and Coding

DOI10.1007/11586821MaRDI QIDQ5897533zbMATH OpenOpenAlexFDO

Authors K. Bentahar

Publication date 1 November 2006

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

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

zbMATH Keywords

DHP-DLP equivalenceElliptic Curve Cryptosystems

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• scientific article; zbMATH DE number 1186977
• The Diffie-Hellman problem and generalization of Verheul's theorem
• scientific article; zbMATH DE number 697834

Cited in

(4)

• Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
• An algorithm for DLP on anomalous elliptic curves over \(\mathbb F_p\)
• The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
• Revisiting discrete logarithm reductions

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 Q5897533)