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

DOI10.1007/S10623-009-9287-XzbMATH Open1174.14030OpenAlexW2092974605MaRDI QIDQ735041FDOQ735041

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

Recommendations

• scientific article
• 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

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)

Cites Work

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

Cited In (12)

• 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
• Infinitely many sign-changing solutions for an elliptic equation involving double critical Hardy–Sobolev–Maz’ya terms
• 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
• Diffie-Hellman Oracles

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)