Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / DSA ; cryptanalysis ; lattice techniques

Date: received 23 Jan 2016

Contact author: poulakis at math auth gr

Available format(s): PDF | BibTeX Citation

Version: 20160125:082733 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]