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

DOI10.1016/J.TCS.2024.114578MaRDI QIDQ6499547zbMATH OpenFDO

Authors Marios Adamoudis, Konstantinos A. Draziotis, Dimitros Poulakis

Publication date 8 May 2024

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

zbMATH Keywords

latticedigital signature algorithmelliptic curve digital signature algorithmLLL algorithmKannan's enumeration algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1088241 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• (EC)DSA lattice attacks based on Coppersmith's method
• A Survey of Public-Key Cryptosystems
• A probabilistic analysis on a lattice attack against DSA
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Algorithms for the shortest and closest lattice vector problems
• An introduction to mathematical cryptography
• Attacking (EC)DSA given only an implicit hint
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Enhancing an attack to DSA schemes
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Lattice attacks on DSA schemes based on Lagrange's algorithm
• Lattice attacks on digital signature schemes
• Lattice-point enumerators of ellipsoids
• New lattice attacks on DSA schemes
• On the security of the digital signature algorithm
• Solving BDD by enumeration: an update
• Some lattice attacks on DSA and ECDSA
• The insecurity of the digital signature algorithm with partially known nonces
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• The state of elliptic curve cryptography

Describes a project that uses

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)