The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
From MaRDI portal
Publication:4268814
DOI10.1137/S0097539796302749zbMath1053.94014MaRDI QIDQ4268814
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards ⋮ Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group ⋮ A cryptographic primitive based on hidden-order groups ⋮ The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications ⋮ Studying the performance of artificial neural networks on problems related to cryptography ⋮ Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations ⋮ Polynomial approximation of bilinear Diffie-Hellman maps ⋮ Two remarks on the vectorization problem ⋮ Unnamed Item ⋮ A provably secure short signature scheme based on discrete logarithms ⋮ Polynomial representations of the Diffie-Hellman mapping ⋮ On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem ⋮ Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography ⋮ Factoring polynomials over special finite fields ⋮ Algebraic curves and cryptography ⋮ Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs ⋮ Security Analysis of the Strong Diffie-Hellman Problem ⋮ Simplified pairing computation and security implications ⋮ An Analysis of the Vector Decomposition Problem ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Quantum algorithms for algebraic problems ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ Self-correctors for Cryptographic Modules ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Generic groups, collision resistance, and ECDSA ⋮ Security of most significant bits of \(g^{x^{2}}\).
