Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard

David Naccache; David M’Raïhl; Serge Vaudenay; Dan Raphaeli

doi:10.1007/bfb0053426

Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard

David Naccache, David M’Raïhl, Serge Vaudenay, Dan Raphaeli

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability of this scheme to various situations.

Original language	English
Title of host publication	Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Alfredo de Santis
Publisher	Springer Verlag
Pages	77-85
Number of pages	9
ISBN (Print)	3540601767, 9783540601760
DOIs	https://doi.org/10.1007/bfb0053426
State	Published - 1995
Externally published	Yes
Event	Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1994 - Perugia, Italy Duration: 9 May 1994 → 12 May 1994

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	950
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1994
Country/Territory	Italy
City	Perugia
Period	9/05/94 → 12/05/94

Access to Document

10.1007/bfb0053426

Cite this

Naccache, D., M’Raïhl, D., Vaudenay, S., & Raphaeli, D. (1995). Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard. In A. de Santis (Ed.), Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 77-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 950). Springer Verlag. https://doi.org/10.1007/bfb0053426

Naccache, David ; M’Raïhl, David ; Vaudenay, Serge et al. / Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard. Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Alfredo de Santis. Springer Verlag, 1995. pp. 77-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fef2de74e14e465395dbb7cae3f0e449,

title = "Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard",

abstract = "The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability of this scheme to various situations.",

author = "David Naccache and David M{\textquoteright}Ra{\"i}hl and Serge Vaudenay and Dan Raphaeli",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1994 ; Conference date: 09-05-1994 Through 12-05-1994",

year = "1995",

doi = "10.1007/bfb0053426",

language = "אנגלית",

isbn = "3540601767",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "77--85",

editor = "{de Santis}, Alfredo",

booktitle = "Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings",

}

Naccache, D, M’Raïhl, D, Vaudenay, S & Raphaeli, D 1995, Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard. in A de Santis (ed.), Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 950, Springer Verlag, pp. 77-85, Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1994, Perugia, Italy, 9/05/94. https://doi.org/10.1007/bfb0053426

Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard. / Naccache, David; M’Raïhl, David; Vaudenay, Serge et al.
Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Alfredo de Santis. Springer Verlag, 1995. p. 77-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 950).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard

AU - Naccache, David

AU - M’Raïhl, David

AU - Vaudenay, Serge

AU - Raphaeli, Dan

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1995.

PY - 1995

Y1 - 1995

N2 - The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability of this scheme to various situations.

AB - The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability of this scheme to various situations.

UR - http://www.scopus.com/inward/record.url?scp=84948995055&partnerID=8YFLogxK

U2 - 10.1007/bfb0053426

DO - 10.1007/bfb0053426

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84948995055

SN - 3540601767

SN - 9783540601760

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 77

EP - 85

BT - Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - de Santis, Alfredo

PB - Springer Verlag

T2 - Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1994

Y2 - 9 May 1994 through 12 May 1994

ER -

Naccache D, M’Raïhl D, Vaudenay S, Raphaeli D. Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard. In de Santis A, editor, Advances in Cryptology - EUROCRYPT 1994 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 1995. p. 77-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0053426

Can D.S.A. be improved? - complexity trade-Offs with the digital signature standard

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this