Attacking (EC)DSA scheme with ephemeral keys sharing specific bits

DOI10.1016/J.TCS.2024.114578MaRDI QIDQ6499547

Dimitrios Poulakis, Marios Adamoudis, Konstantinos A. Draziotis

Publication date: 8 May 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

latticeLLL algorithmKannan's enumeration algorithmdigital signature algorithmelliptic curve digital signature algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• (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
• The state of elliptic curve cryptography
• Enhancing an attack to DSA schemes
• A probabilistic analysis on a lattice attack against DSA
• Lattice-point enumerators of ellipsoids
• Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm
• An Introduction to Mathematical 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
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Survey of Public-Key Cryptosystems
• Solving BDD by Enumeration: An Update
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Lattice attacks on digital signature schemes

This page was built for publication: Attacking (EC)DSA scheme with ephemeral keys sharing specific bits