New Lattice Attacks on DSA Schemes

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. MSC 2010: 94A60, 11T71, 11Y16.

• Type: Journal
• Year: 2016
• Where: IACR
• Authors: Dimitrios Poulakis
• Keywords: Biometrics, IACR 2016