Skip to main content
Conference Proceedings

Lattice attacks on DSA schemes based on Lagrange's algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8080 LNCS 119-131
DOI: 10.1007/978-3-642-40663-8_13
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using Lagrange's algorithm for the computation of a basis of a 2-dimensional lattice formed by two successive minima, we present some attacks on DSA and ECDSA which permit us, under some assumptions, to compute the secret key of the scheme provided that one or two signed messages are given. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Draziotis, K., & Poulakis, D. (2013). Lattice attacks on DSA schemes based on Lagrange’s algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8080 LNCS, pp. 119–131). https://doi.org/10.1007/978-3-642-40663-8_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free