Skip to main content
Conference ProceedingsOPEN ACCESS

On the security of Lenstra’s variant of DSA without long inversions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 1992 64-72
DOI: 10.1007/3-540-44586-2_5
0Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We use bounds of exponential sums to show that for a wide class of parameters the modification of the DSA signature scheme proposed by A. K. Lenstra at Asiacrypt’96 is as secure as the original scheme.

Cite

CITATION STYLE

APA

Lenstra, A. K., & Shparlinski, I. E. (2001). On the security of Lenstra’s variant of DSA without long inversions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1992, pp. 64–72). Springer Verlag. https://doi.org/10.1007/3-540-44586-2_5

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