On relationship of computational Diffie-Hellman problem and computational square-root exponent problem

DOI10.1007/978-3-642-20901-7_19MaRDI QIDQ3005597zbMATH OpenOpenAlexFDO

Authors Fangguo Zhang, Ping Wang

Publication date 8 June 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-20901-7_19

zbMATH Keywords

Diffie-Hellman problemequivalencesquare Diffie-Hellman problemsquare-root exponent problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• The square root Diffie-Hellman problem
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• scientific article; zbMATH DE number 1951620
• On the connection between the discrete logarithms and the Diffie-Hellman problem

Cites work

• A new signature scheme without random oracles from bilinear pairings
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Diffie-Hellman Oracles
• Efficient signature generation by smart cards
• scientific article; zbMATH DE number 1583811 (Why is no real title available?)
• scientific article; zbMATH DE number 1722682 (Why is no real title available?)
• scientific article; zbMATH DE number 1302808 (Why is no real title available?)
• scientific article; zbMATH DE number 1406786 (Why is no real title available?)
• New directions in cryptography
• The Diffie-Hellman protocol
• The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

Cited in

(2)

• The square root Diffie-Hellman problem
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem

This page was built for publication: On relationship of computational Diffie-Hellman problem and computational square-root exponent problem

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