Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms

Recommendations

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
On the connection between the discrete logarithms and the Diffie-Hellman problem
Discrete logarithms: The effectiveness of the index calculus method
scientific article; zbMATH DE number 4187705
Diffie-Hellman Oracles

Cited in

(36)

Synthesizers and their application to the parallel construction of pseudo-random functions
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
Fast generation of prime numbers and secure public-key cryptographic parameters.
Weakness of $\mathbb{F}_{3^{6 \cdot 1429}}$ and $\mathbb{F}_{2^{4 \cdot 3041}}$ for discrete logarithm cryptography
The GN-authenticated key agreement
Generic groups, collision resistance, and ECDSA
Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
On the impossibility of purely algebraic signatures
Computational Number Theory and Cryptography
An observation on associative one-way functions in complexity theory
The kernel matrix Diffie-Hellman assumption
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
Diffie-Hellman Oracles
Algorithms for black-box fields and their application to cryptography
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
An elliptic curve analogue of McCurley's key agreement scheme
Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
An Analysis of the Vector Decomposition Problem
On the Equivalence of Generic Group Models
Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
scientific article; zbMATH DE number 4187705 (Why is no real title available?)
Breaking RSA Generically Is Equivalent to Factoring
On the statistical properties of Diffie-Hellman distributions
Full quantum equivalence of group action DLog and CDH, and more
Cryptographic multilinear maps using pro-p groups
A note on non-interactive zero-knowledge from CDH
Cryptographic group and semigroup actions
Full quantum equivalence of group action DLog and CDH, and more
Pairing-free blind signatures from CDH assumptions
Decrypting nonlinearity: Koopman interpretation and analysis of cryptosystems
Short signatures from DDH without pairings or random oracles
Revisiting discrete logarithm reductions
Comparing two pairing-based aggregate signature schemes

This page was built for publication: Towards the equivalence of 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 Q4940702)