Cryptology ePrint Archive: Report 2012/612
Analysis of the Non-Perfect Table Fuzzy Rainbow Tradeoff
Byoung-Il Kim and Jin Hong
Abstract: Time memory tradeoff algorithms are tools for inverting one-way functions, and they are often used to recover passwords from unsalted password hashes. There are many publicly known tradeoff algorithms, and the rainbow tradeoff is widely believed to be the best algorithm.
This work provides an accurate complexity analysis of the non-perfect table version of the fuzzy rainbow tradeoff algorithm, which has not yet received much attention. It is shown that, when the pre-computation cost and the online efficiency are both taken into consideration, the non-perfect fuzzy rainbow tradeoff is preferable to the original rainbow tradeoff in many situations.
Category / Keywords: secret-key cryptography / time memory tradeoff, rainbow table, fuzzy rainbow, distinguished point
Original Publication (with major differences): ACISP 2013 (LNCS 7959)
Date: received 30 Oct 2012, last revised 14 Oct 2013
Contact author: jinhong at snu ac kr
Available format(s): PDF | BibTeX Citation
Version: 20131015:054422 (All versions of this report)
Short URL: ia.cr/2012/612
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]