Security in Communication Networks

DOI10.1007/B105083MaRDI QIDQ5491685zbMATH OpenOpenAlexFDO

Authors Adam L. Young, Moti Yung

Publication date 10 October 2006

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

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

zbMATH Keywords

Black-Box ReductionsComputational Diffie-HellmanDecision Diffie-HellmanDiffie-Hellman (DH)Discrete-LogJDLLDLOraclesPublic Key Cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Diffie-Hellman Oracles
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
• The square root Diffie-Hellman problem

Cited in

(6)

• On the index of the Diffie-Hellman mapping
• Backdoors in pseudorandom number generators: possibility and impossibility results
• Diffie-Hellman Oracles
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• scientific article; zbMATH DE number 1341882 (Why is no real title available?)
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem

This page was built for publication: Security in Communication Networks

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