Paper 2011/393

Analysis and Improvement of Thing's Time-Memory Trade-Off Attack

Zhenqi Li, Dongdai Lin, and Wenhao Wang

Abstract

Cryptanalytic time memory trade-off is a probabilistic algorithm for inverting a generic one-way function. Since its first introduction by Hellman, many variants and their analysis results have appeared. Thing gave a new time-memory trade-off method in 2009. His new method has higher success probability and lower memory requirements, compared with Oechslin's rainbow table, but its drawback is obvious and make it to be an impractical method. In this paper, we analyze and improve Thing's method and propose a new method. We compare the success probability, memory requirements and analysis time between our method and Thing's method. Results show that our new method is better than Thing's method and fix its innate drawback.

Metadata
Available format(s)
-- withdrawn --
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
time memory tradeoffrainbow attack.
Contact author(s)
lizhenqi @ is iscas ac cn
History
2011-08-10: withdrawn
2011-07-20: received
See all versions
Short URL
https://ia.cr/2011/393
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.