Attacking (EC)DSA With Partially Known Multiples of Nonces

Marios Adamoudis; Konstantinos A.  Draziotis; Dimitrios Poulakis

Paper 2021/347

Attacking (EC)DSA With Partially Known Multiples of Nonces

Marios Adamoudis, Konstantinos A. Draziotis, and Dimitrios Poulakis

Abstract

In this paper, we improve the theoretical background of the attacks on the DSA schemes given in [1, 29], and we present some new more practical attacks.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: Public Key Cryptography Digital Signatures Digital Signature Algorithm Elliptic Curve Digital Signature Algorithm Closest Vector Problem Discrete Logarithm Lattices LLL algorithm BKZ algorithm Closest Vector Problem Babai’s Nearest Plane Algorithm.
Contact author(s): poulakis @ math auth gr
History: 2021-03-17: received
Short URL: https://ia.cr/2021/347
License: CC BY

BibTeX

@misc{cryptoeprint:2021/347,
      author = {Marios Adamoudis and Konstantinos A.  Draziotis and Dimitrios Poulakis},
      title = {Attacking ({EC}){DSA} With Partially Known Multiples of Nonces},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/347},
      year = {2021},
      url = {https://eprint.iacr.org/2021/347}
}