On the Security of Lenstra's Variant of DSA without Long Inversions

Authors:
Arjen K. Lenstra;Igor Shparlinski
Affiliations:
-;-
Venue:
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Year:
2001

Citing 7
Cited 0

Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem

Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Finite fields

Finite fields
Lattice Attacks on Digital Signature Schemes

Designs, Codes and Cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Generating Standard DSA Signatures Without Long Inversion

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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'96 is as secure as the original scheme.