Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 165

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —

Open access
Naccache, David, M'RaÏhi, David, Vaudenay, Serge, Raphaeli, Dan · 1995 · Lecture Notes in Computer Science

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. In this paper, we present six new DSA-based protocols for: Performing a quick batch-verification of n signatures. The proposed scheme allows to make the economy of ≈ 450 n modular multiplications. Avoiding the cumbersome calculation of 1 / k mod q by the signer. Compressing sets of DSA transactions into shorter archive signatures . Generating signatures from pre-calculated “Use & Throw” 224-bit signature-coupons . Self-certifying the moduli and bit-patterning directly q on p (gain of 60.4% in key size). All our schemes combine in a natural way full DSA compatibility and flexible trade-offs between computational complexity, transmission overheads and key sizes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/bfb0053426

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 165

Metadata

Authors
Naccache, D., M'RaÏhi, D., Vaudenay, S., & Raphaeli, D.
Venue
Lecture Notes in Computer Science
Published
1995
Pages
77-85
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1569543440
Cited by
165
References
1
FWCI
4.45
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.