The Diffie-Hellman problem and generalization of Verheul's theorem

DOI10.1007/s10623-009-9287-xzbMath1174.14030OpenAlexW2092974605MaRDI QIDQ735041

Dustin Moody

Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9287-x

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves (14H52) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)

Related Items (2)

Infinitely many sign-changing solutions for an elliptic equation involving double critical Hardy–Sobolev–Maz’ya terms ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closed formulae for the Weil pairing inversion
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• The Diffie-Hellman protocol
• On Polynomial Interpolations related to Verheul Homomorphisms
• Constructing elliptic curves of prime order
• Fast algorithms for computing isogenies between elliptic curves
• Aspects of Pairing Inversion
• Reducing elliptic curve logarithms to logarithms in a finite field
• Easy Decision Diffie-Hellman Groups
• On Pairing Inversion Problems
• Simplified pairing computation and security implications
• Cryptography and Coding
• Coding and Cryptography

This page was built for publication: The Diffie-Hellman problem and generalization of Verheul's theorem