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
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.
Integrity signals
Registry
Cites
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.
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
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
Self-citation
Cited by
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914
RFID security and privacy: a research survey
Juels, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861395 · Cited by 1,911
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
Real Time Cryptanalysis of A5/1 on a PC
Biryukov, A., Shamir, A., & Wagner, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_1 · Cited by 452
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
Biryukov, A., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_1 · Cited by 339
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.