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
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)
Pages
64-72
Conference
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
