Cited by 8,059Cryptography and Data SecurityCryptography and Residue ArithmeticCoding theory and cryptography

A public key cryptosystem and a signature scheme based on discrete logarithms

Elgamal, T.·1985·IEEE Transactions on Information Theory

Abstract

A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.

Integrity signals

Registry

Crossref · 10.1109/tit.1985.1057074

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The optimal number of clusters in terms of energy consumption and performance for a group of 100 nodes is 10.

    “The selection of the number of clusters is based on the work by [68], according to which the optimal number of clusters in terms of energy consumption and performance for a group of 100 nodes is 10.”

    From Lightweight blockchain for healthcare (2019) · cites this paper as [68]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Elgamal, T.
Affiliations
Hewlett-Packard (United States) (US)
Corresponding author
Elgamal, T.
Venue
IEEE Transactions on Information Theory
Published
1985-07
Volume
31
Issue
4
Pages
469-472
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2108834246
Cited by
8,059
References
12
Citations by year
2026: 134 · 2025: 274 · 2024: 302 · 2023: 311 · 2022: 324 · 2021: 343 · 2020: 349 · 2019: 327 · 2018: 290 · 2017: 318 · 2016: 308 · 2015: 335 · 2014: 331 · 2013: 371 · 2012: 359
FWCI
8.53
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Information Theory (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
public-key cryptosystems, digital signatures, discrete logarithm problem, finite fields, cryptographic security

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