On the security of Lenstra’s variant of DSA without long inversions

Arjen K. Lenstra, Igor E. Shparlinski

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

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.

Original languageEnglish
Title of host publicationPublic Key Cryptography
Subtitle of host publication4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13–15, 2001 Proceedings
EditorsKwangjo Kim
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages64-72
Number of pages9
ISBN (Electronic)9783540445869
ISBN (Print)3540416587, 9783540416586
DOIs
Publication statusPublished - Feb 2001
Event4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC - 2001 - Cheju Island, Korea, Republic of
Duration: 13 Feb 200115 Feb 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1992
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC - 2001
CountryKorea, Republic of
CityCheju Island
Period13/02/0115/02/01

Fingerprint Dive into the research topics of 'On the security of Lenstra’s variant of DSA without long inversions'. Together they form a unique fingerprint.

Cite this