Paper 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 fuzzy rainbow tradeoff algorithm, which has not yet received much attention. Based on the analysis results, we show that, when the pre-computation cost and the online efficiency are both taken into consideration, the fuzzy rainbow tradeoff may be seen as preferable to the original rainbow tradeoff in many situations.