On the complexity of the discrete logarithm and Diffie-Hellman problems
From MaRDI portal
Publication:1827563
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
Cites work
- scientific article; zbMATH DE number 1588479 (Why is no real title available?)
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- scientific article; zbMATH DE number 2086223 (Why is no real title available?)
- scientific article; zbMATH DE number 438988 (Why is no real title available?)
- scientific article; zbMATH DE number 4168790 (Why is no real title available?)
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- scientific article; zbMATH DE number 1303114 (Why is no real title available?)
- scientific article; zbMATH DE number 1341882 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1942430 (Why is no real title available?)
- scientific article; zbMATH DE number 1842493 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1406786 (Why is no real title available?)
- scientific article; zbMATH DE number 6472645 (Why is no real title available?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- A general framework for subexponential discrete logarithm algorithms
- A key-exchange system based on imaginary quadratic fields
- A sieve algorithm for the shortest lattice vector problem
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Algorithms for black-box fields and their application to cryptography
- An algorithm for solving the discrete log problem on hyperelliptic curves
- An extension of Satoh's algorithm and its implementation
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Complexity of a determinate algorithm for the discrete logarithm
- Counting points on elliptic curves over finite fields
- Cryptography in quadratic function fields
- Diffie-Hellman Oracles
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Linear complexity of the discrete logarithm
- Monte Carlo Methods for Index Computation (mod p)
- New directions in cryptography
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- On the connection between the discrete logarithms and the Diffie-Hellman problem
- On the distribution of Diffie-Hellman triples with sparse exponents
- On the distribution of the Diffie-Hellman pairs
- On the statistical properties of Diffie-Hellman distributions
- Polynomial representations of the Diffie-Hellman mapping
- Real and imaginary quadratic representations of hyperelliptic function fields
- Reducing elliptic curve logarithms to logarithms in a finite field
- Security of most significant bits of \(g^{x^{2}}\).
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Square-root algorithms for the discrete logarithm problem (a survey)
- The Diffie-Hellman protocol
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
- The canonical lift of an ordinary elliptic curve over a finite field and its point counting
Cited in
(34)- Intractable problems in cryptography
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- The co-Diffie-Hellman problem over elliptic curves
- scientific article; zbMATH DE number 4187705 (Why is no real title available?)
- 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
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Security in Communication Networks
- Algebraic groups and discrete logarithm
- Another look at non-standard discrete log and Diffie-Hellman problems
- Elementary thoughts on discrete logarithms
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- 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
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
- On the bit security of elliptic curve Diffie-Hellman
- \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
- scientific article; zbMATH DE number 1512694 (Why is no real title available?)
- scientific article; zbMATH DE number 1951620 (Why is no real title available?)
- On the index of the Diffie-Hellman mapping
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
- Algorithmic Number Theory
- Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
- scientific article; zbMATH DE number 1857540 (Why is no real title available?)
- Matrix representation of cryptographic functions
- The Diffie-Hellman problem and generalization of Verheul's theorem
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)
