On the complexity of the discrete logarithm and Diffie-Hellman problems
From MaRDI portal
Publication:1827563
DOI10.1016/J.JCO.2004.01.002zbMATH Open1052.94014OpenAlexW2020427895MaRDI QIDQ1827563FDOQ1827563
Authors: Theo Garefalakis, Ian Blake 
Publication date: 6 August 2004
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2004.01.002
Recommendations
- On the connection between the discrete logarithms and the Diffie-Hellman problem
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- scientific article; zbMATH DE number 4214161
- On the bit security of the Diffie-Hellman key
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- A sieve algorithm for the shortest lattice vector problem
- New directions in cryptography
- Monte Carlo Methods for Index Computation (mod p)
- An algorithm for solving the discrete log problem on hyperelliptic curves
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
- Title not available (Why is that?)
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Diffie-Hellman Oracles
- Title not available (Why is that?)
- An extension of Satoh's algorithm and its implementation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- On the statistical properties of Diffie-Hellman distributions
- Title not available (Why is that?)
- Counting points on elliptic curves over finite fields
- On the distribution of the Diffie-Hellman pairs
- Security of most significant bits of \(g^{x^{2}}\).
- Title not available (Why is that?)
- The canonical lift of an ordinary elliptic curve over a finite field and its point counting
- Title not available (Why is that?)
- Complexity of a determinate algorithm for the discrete logarithm
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- On the distribution of Diffie-Hellman triples with sparse exponents
- The Diffie-Hellman protocol
- A general framework for subexponential discrete logarithm algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Cryptography in quadratic function fields
- Real and imaginary quadratic representations of hyperelliptic function fields
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- A key-exchange system based on imaginary quadratic fields
- Polynomial representations of the Diffie-Hellman mapping
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- Square-root algorithms for the discrete logarithm problem (a survey)
- Algorithms for black-box fields and their application to cryptography
- Linear complexity of the discrete logarithm
- Title not available (Why is that?)
- On the connection between the discrete logarithms and the Diffie-Hellman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (34)
- Intractable problems in cryptography
- Title not available (Why is that?)
- The co-Diffie-Hellman problem over elliptic curves
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem
- Security in Communication Networks
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Algebraic groups and discrete logarithm
- Another look at non-standard discrete log and Diffie-Hellman problems
- Elementary thoughts on discrete logarithms
- Title not available (Why is that?)
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
- On generic complexity of the discrete logarithm problem
- The Discrete Logarithm Hides $O(\log n)$ Bits
- Transformations of two cryptographic problems in terms of matrices
- On the bit security of the Diffie-Hellman key
- On the bit security of elliptic curve Diffie-Hellman
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
- \texttt{NP}-complete sets for computing discrete logarithms and integer factorization
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Discrete logarithms, Diffie-Hellman, and reductions
- Cryptography and Coding
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
- Discrete logarithm like problems and linear recurring sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic Number Theory
- Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
- Title not available (Why is that?)
- On the index of the Diffie-Hellman mapping
- Matrix representation of cryptographic functions
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
- The Diffie-Hellman problem and generalization of Verheul's theorem
Uses Software
This page was built for publication: On the complexity of the discrete logarithm and Diffie-Hellman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827563)
