The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

DOI10.1137/S0097539796302749MaRDI QIDQ4268814zbMATH OpenFDO

Authors Ueli M. Maurer, S. Wolf

Publication date 28 October 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539796302749

zbMATH Keywords

Diffie-Hellman protocoldiscrete logarithmselliptic curvesfinite fieldspublic-key cryptography

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1406786
• scientific article; zbMATH DE number 4187705
• Diffie-Hellman Oracles
• On the connection between the discrete logarithms and the Diffie-Hellman problem

Cited in

(36)

• A structural comparison of the computational difficulty of breaking discrete log cryptosystems
• Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
• Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Security of most significant bits of \(g^{x^{2}}\).
• Polynomial approximation of bilinear Diffie-Hellman maps
• A provably secure short signature scheme based on discrete logarithms
• Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
• Generic groups, collision resistance, and ECDSA
• Polynomial representations of the Diffie-Hellman mapping
• On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
• Quantum algorithms for algebraic problems
• Self-correctors for cryptographic modules
• On the connection between the discrete logarithms and the Diffie-Hellman problem
• A cryptographic primitive based on hidden-order groups
• Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
• Security Analysis of the Strong Diffie-Hellman Problem
• The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
• scientific article; zbMATH DE number 1406786 (Why is no real title available?)
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
• Simplified pairing computation and security implications
• An Analysis of the Vector Decomposition Problem
• scientific article; zbMATH DE number 4187705 (Why is no real title available?)
• Breaking RSA Generically Is Equivalent to Factoring
• Algebraic curves and cryptography
• Factoring polynomials over special finite fields
• Discrete logarithm problems with auxiliary inputs
• Two remarks on the vectorization problem
• scientific article; zbMATH DE number 7716603 (Why is no real title available?)
• A tightly secure ID-based signature scheme under DL assumption in AGM
• Cryptographic group and semigroup actions
• Additive randomized encodings from public key encryption
• Revisiting discrete logarithm reductions
• Discrete logarithms, Diffie-Hellman, and reductions
• Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
• Studying the performance of artificial neural networks on problems related to cryptography

This page was built for publication: The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

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