Welcome to the resource topic for 2016/058
Title:
New Lattice Attacks on DSA Schemes
Authors: 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.
ePrint: https://eprint.iacr.org/2016/058
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .