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

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

A cryptanalytic time-memory trade-off

Hellman, M.·1980·IEEE Transactions on Information Theory

Abstract

A probabilistic method is presented which cryptanalyzes anyNkey cryptosystem inN^{2/3}operational withN^{2/3}words of memory (average values) after a precomputation which requiresNoperations. If the precomputation can be performed in a reasonable time period (e.g, several years), the additional computation required to recover each key compares very favorably with theNoperations required by an exhaustive search and theNwords of memory required by table lookup. When applied to the Data Encryption Standard (DES) used in block mode, it indicates that solutions should cost between1 and100 each. The method works in a chosen plaintext attack and, if cipher block chaining is not used, can also be used in a ciphertext-only attack.

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.1109/tit.1980.1056220

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 701

Metadata

Authors
Hellman, M.
Venue
IEEE Transactions on Information Theory
Published
1980-07
Volume
26
Issue
4
Pages
401-406
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2012646342
Cited by
701
References
1
FWCI
3.51
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A cryptanalytic time-memory trade-off. https://app.cochat.ai/papers/10.1109/tit.1980.1056220
The paper
Hellman, M. (1980). A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1980.1056220

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.