Paper 2016/058

New Lattice Attacks on DSA Schemes

Dimitrios Poulakis

Abstract

We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently. Using this result we develop attacks against the DSA schemes which, under some assumptions, can provide the secret key in the case where one or several signed messages are available.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
DSAcryptanalysislattice techniques
Contact author(s)
poulakis @ math auth gr
History
2016-01-25: received
Short URL
https://ia.cr/2016/058
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/058,
      author = {Dimitrios Poulakis},
      title = {New Lattice  Attacks on DSA Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2016/058},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/058}},
      url = {https://eprint.iacr.org/2016/058}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.