DocumentCode
931908
Title
A cryptanalytic time-memory trade-off
Author
Hellman, Martin E.
Volume
26
Issue
4
fYear
1980
fDate
7/1/1980 12:00:00 AM
Firstpage
401
Lastpage
406
Abstract
A probabilistic method is presented which cryptanalyzes any
key cryptosystem in
operational with
words of memory (average values) after a precomputation which requires
operations. 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 the
operations required by an exhaustive search and the
words of memory required by table lookup. When applied to the Data Encryption Standard (DES) used in block mode, it indicates that solutions should cost between
100 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.
key cryptosystem in
operational with
words of memory (average values) after a precomputation which requires
operations. 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 the
operations required by an exhaustive search and the
words of memory required by table lookup. When applied to the Data Encryption Standard (DES) used in block mode, it indicates that solutions should cost between
100 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.Keywords
Cryptography; Costs; Cryptography; Length measurement; Table lookup; Testing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1980.1056220
Filename
1056220
Link To Document