@inproceedings{823741e2105a43f9a964f1ab1f674ca5,
title = "On the security of Lenstra{\textquoteright}s variant of DSA without long inversions",
abstract = "We use bounds of exponential sums to show that for a wide class of parameters the modification of the DSA signature scheme proposed by A. K. Lenstra at Asiacrypt{\textquoteright}96 is as secure as the original scheme.",
author = "Lenstra, {Arjen K.} and Shparlinski, {Igor E.}",
year = "2001",
month = feb,
doi = "10.1007/3-540-44586-2_5",
language = "English",
isbn = "3540416587",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "64--72",
editor = "Kwangjo Kim",
booktitle = "Public Key Cryptography",
address = "United States",
note = "4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC - 2001 ; Conference date: 13-02-2001 Through 15-02-2001",
}