On the security of Lenstra's variant of DSA without long inversions
Lenstra, Arjen K.; Shparlinski, I. E.
2001

Files

Abstract

We use bounds of exponential sums to show that, for a wide class of parameters, the modification of the digital signature algorithm (DSA) scheme proposed by A.K. Lenstra (see Proc. Asiacrypt'96, Lect. Notes in Comp. Sci., vol.1163, p.57-64, 1996) is as secure as the original scheme

Details

Title On the security of Lenstra's variant of DSA without long inversions
Author(s) Lenstra, Arjen K. ; Shparlinski, I. E.
Published in Public Key Crytography. 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001. Proceedings
Series Lecture Notes in Computer Science, 1992
Pages 64-72
Conference Public Key Crytography. 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Berlin, Germany
Date 2001
Keywords
DOI https://doi.org/10.1007/3-540-44586-2_5
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published
Record creation date 2010-06-25

Actions

Preview