Attacking (EC)DSA with partially known multiples of nonces
From MaRDI portal
Publication:6647745
DOI10.1016/J.IC.2024.105203MaRDI QIDQ6647745
Konstantinos A. Draziotis, Marios Adamoudis, Dimitros Poulakis
Publication date: 3 December 2024
Published in: Information and Computation (Search for Journal in Brave)
LLL algorithmdigital signature algorithmelliptic curve digital signature algorithmBabai's nearest plane algorithm
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- (EC)DSA lattice attacks based on Coppersmith's method
- New lattice attacks on DSA schemes
- Some lattice attacks on DSA and ECDSA
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- On the security of the digital signature algorithm
- The insecurity of the digital signature algorithm with partially known nonces
- Enhancing an attack to DSA schemes
- A probabilistic analysis on a lattice attack against DSA
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm
- Mathematics of public key cryptography.
- Algorithms for the Shortest and Closest Lattice Vector Problems
- Attacking (EC)DSA Given Only an Implicit Hint
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Cache-Timing Template Attacks
- Solving BDD by Enumeration: An Update
- Extended Hidden Number Problem and Its Cryptanalytic Applications
- Public Key Cryptography - PKC 2005
- Lattice attacks on digital signature schemes
This page was built for publication: Attacking (EC)DSA with partially known multiples of nonces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647745)
