The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications

DOI10.1112/S1461157000001042zbMath1093.14504OpenAlexW2114633560MaRDI QIDQ4827624

Frederik Vercauteren, A. Muzereau, Nigel P. Smart

Publication date: 18 November 2004

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.lms.ac.uk/jcm/7/lms2003-034/

Mathematics Subject Classification ID

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

Related Items (4)

Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group ⋮ On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem ⋮ Products of three pairwise coprime integers in short intervals ⋮ Comparing two pairing-based aggregate signature schemes

Cites Work

• The Diffie-Hellman protocol
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• A Note on Elliptic Curves Over Finite Fields
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Abelian varieties over finite fields

This page was built for publication: The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications