Paper 2012/612 Original: eprint.iacr.org/2012/612 ↗
Analysis of the Non-Perfect Table Fuzzy Rainbow Tradeoff
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
- Preprint.
- History
- 2013-10-15: last updated
- 2012-11-01: published
- Short URL
- https://ia.cr/2012/612
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2012/612}
}