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

Lenstra, Arjen K.; Shparlinski, I. E.

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

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

Published in:

Public Key Crytography. 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001. Proceedings (Lecture Notes in Computer Science Vol.1992), 64 - 72

Presented at:

Public Key Crytography. 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001. Proceedings (Lecture Notes in Computer Science Vol.1992), Berlin, Germany

Year:

2001

Keywords:

cryptography ; message authentication

Laboratories:

LACAL

Record appears in:

Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Publicly available
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published