You are looking at a specific version 20160125:082733 of this paper.
See the latest version.
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)
- 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
-
CC BY