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:
Laboratories:




 Record created 2010-06-25, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)