1980/07/01 by Martin E. Hellman · 3 citations
Computer Science · #Cryptographic Implementations and Security #Chaos-based Image/Signal Encryption #Coding theory and cryptography
paper · doi:10.1109/tit.1980.1056220
openalex publication_date 1980/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
A probabilistic method is presented which cryptanalyzes anyNkey cryptosystem inN2/3operational withN2/3words 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.