On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem

DOI10.1007/978-3-642-20901-7_19zbMath1272.94069OpenAlexW30134136MaRDI QIDQ3005597

Ping Wang, Fangguo Zhang

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

equivalencesquare Diffie-Hellman problemDiffie-Hellman problemsquare-root exponent problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• The Diffie-Hellman protocol
• A New Signature Scheme Without Random Oracles from Bilinear Pairings
• Diffie-Hellman Oracles
• 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.)
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications

This page was built for publication: On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem