Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
From MaRDI portal
Publication:6499547
DOI10.1016/J.TCS.2024.114578MaRDI QIDQ6499547FDOQ6499547
Authors: Marios Adamoudis, Konstantinos A. Draziotis, Dimitros Poulakis 
Publication date: 8 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
latticedigital signature algorithmelliptic curve digital signature algorithmLLL algorithmKannan's enumeration algorithm
Cites Work
- Title not available (Why is that?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- On the security of the digital signature algorithm
- (EC)DSA lattice attacks based on Coppersmith's method
- Some lattice attacks on DSA and ECDSA
- Lattice attacks on digital signature schemes
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- The insecurity of the digital signature algorithm with partially known nonces
- The state of elliptic curve cryptography
- Lattice-point enumerators of ellipsoids
- Lattice attacks on DSA schemes based on Lagrange's algorithm
- New lattice attacks on DSA schemes
- Attacking (EC)DSA given only an implicit hint
- Title not available (Why is that?)
- A Survey of Public-Key Cryptosystems
- An introduction to mathematical cryptography
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Algorithms for the shortest and closest lattice vector problems
- Enhancing an attack to DSA schemes
- Solving BDD by enumeration: an update
- Cryptographic Hardware and Embedded Systems - CHES 2004
- A probabilistic analysis on a lattice attack against DSA
This page was built for publication: Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499547)
