IACR News item: 25 January 2016
Dimitrios Poulakis
ePrint Report
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.
Additional news items may be found on the IACR news page.