Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

IACR
2016

favoriteEmaildiscussreport

44views Biometrics» more IACR 2016»

New Lattice Attacks on DSA Schemes

8 years 7 months ago

New Lattice Attacks on DSA Schemes

Download eprint.iacr.org

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 eﬃciently. 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.

Dimitrios Poulakis

Real-time Traffic

Biometrics | IACR 2016 |

claim paper

Related Content

» Secret Key Leakage from Public Key Perturbation of DLPBased Cryptosystems

» On the Security of RDSA

» Short Signatures Without Random Oracles

» Better Key Sizes and Attacks for LWEBased Encryption

» Weak Property of Malleability in NTRUSign

» Attacking Unbalanced RSACRT Using SPA

» Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	IACR
Authors	Dimitrios Poulakis

Comments (0)