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

DOI10.1007/S10623-009-9287-XMaRDI QIDQ735041zbMATH OpenOpenAlexFDO

Authors 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) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05) Elliptic curves (14H52)

Recommendations

• scientific article; zbMATH DE number 1186931
• Algebraic generalization of Diffie-Hellman key exchange
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• The elliptic curve Diffie-Hellman problem and an equivalent hard problem for elliptic divisibility sequences
• An algebraic framework for Diffie-Hellman assumptions
• An algebraic framework for Diffie-Hellman assumptions
• Bit security of the hyperelliptic curves Diffie-Hellman problem
• The co-Diffie-Hellman problem over elliptic curves
• The twin Diffie-Hellman problem and applications

Cites work

• scientific article; zbMATH DE number 1722679 (Why is no real title available?)
• scientific article; zbMATH DE number 438988 (Why is no real title available?)
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 45834 (Why is no real title available?)
• scientific article; zbMATH DE number 1210367 (Why is no real title available?)
• scientific article; zbMATH DE number 1759768 (Why is no real title available?)
• scientific article; zbMATH DE number 2086872 (Why is no real title available?)
• Aspects of Pairing Inversion
• Closed formulae for the Weil pairing inversion
• Coding and Cryptography
• Constructing elliptic curves of prime order
• Cryptography and Coding
• Easy Decision Diffie-Hellman Groups
• Elliptic curves. Number theory and cryptography
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Fast algorithms for computing isogenies between elliptic curves
• On Pairing Inversion Problems
• On Polynomial Interpolations related to Verheul Homomorphisms
• Reducing elliptic curve logarithms to logarithms in a finite field
• Simplified pairing computation and security implications
• The Diffie-Hellman protocol

Cited in

(12)

• Diffie-Hellman Oracles
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• Security Analysis of the Strong Diffie-Hellman Problem
• Elliptic curve cryptography: the serpentine course of a paradigm shift
• Another look at non-standard discrete log and Diffie-Hellman problems
• On Polynomial Interpolations related to Verheul Homomorphisms
• Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
• Cryptography and Coding
• A generalization of Verheul's theorem for some ordinary curves
• The square root Diffie-Hellman problem
• An algebraic framework for Diffie-Hellman assumptions
• Infinitely many sign-changing solutions for an elliptic equation involving double critical Hardy-Sobolev-Maz'ya terms

Describes a project that uses

Uses Software

• SageMath

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

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