On the Bit Security of Elliptic Curve Diffie–Hellman
From MaRDI portal
Publication:5738794
DOI10.1007/978-3-662-54365-8_15zbMath1404.94112OpenAlexW2585405630MaRDI QIDQ5738794
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54365-8_15
Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (3)
Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ On the Bit Security of Elliptic Curve Diffie–Hellman ⋮ Cryptanalysis of elliptic curve hidden number problem from PKC 2017
Cites Work
- On the modular inversion hidden number problem
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- The insecurity of the digital signature algorithm with partially known nonces
- On the bit security of the Diffie-Hellman key
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys
- Predicting nonlinear pseudorandom number generators
- Sparse polynomial approximation in finite fields
- Cryptography and Coding
- On the Bits of Elliptic Curve Diffie-Hellman Keys
- On the Bit Security of Elliptic Curve Diffie–Hellman
- Public Key Cryptography – PKC 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Bit Security of Elliptic Curve Diffie–Hellman
