Loading...
conference paper
On the security of Lenstra's variant of DSA without long inversions
2001
Public Key Crytography. 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001. Proceedings
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
Loading...
Name
EPFL-CONF-149710.pdf
Access type
openaccess
Size
155.2 KB
Format
Adobe PDF
Checksum (MD5)
a3bd8d82336007d95aa4adaf6908d8db