Analysis of the Non-Perfect Table Fuzzy Rainbow Tradeoff

Byoung-Il Kim; Jin Hong

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 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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Major revision. ACISP 2013 (LNCS 7959)
DOI: 10.1007/978-3-642-39059-3_24
Keywords: time memory tradeoff rainbow table fuzzy rainbow distinguished point
Contact author(s): jinhong @ snu ac kr
History: 2013-10-15: last of 2 revisions; 2012-11-01: received; See all versions
Short URL: https://ia.cr/2012/612
License: CC BY

BibTeX

@misc{cryptoeprint:2012/612,
      author = {Byoung-Il Kim and Jin Hong},
      title = {Analysis of the Non-Perfect Table Fuzzy Rainbow Tradeoff},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/612},
      year = {2012},
      doi = {10.1007/978-3-642-39059-3_24},
      url = {https://eprint.iacr.org/2012/612}
}