Cryptology ePrint Archive: Report 2010/176

A Comparison of Cryptanalytic Tradeoff Algorithms

Jin Hong and Sunghwan Moon

Abstract: Three time memory tradeoff algorithms are compared in this paper. Specifically, the classical tradeoff algorithm by Hellman, the distinguished point tradeoff method, and the rainbow table method, in their non-perfect table versions, are treated.

We show that, under parameters and assumptions that are typically considered in theoretic discussions of the tradeoff algorithms, Hellman and distinguished point tradeoffs perform very close to each other and that the rainbow table method performs somewhat better than the other two algorithms. Our method of comparison can easily be applied to other situations, where the conclusions could be different.

The analysis of tradeoff efficiency presented in this paper does not ignore the effects of false alarms and also covers techniques for reducing storage, such as ending point truncations and index tables. Our comparison of algorithms takes the success probabilities and pre-computation efforts fully into account.

Category / Keywords: secret-key cryptography / time memory tradeoff, Hellman, distinguished point, rainbow table, random function

Original Publication (with minor differences): IACR-JOC-2013

Date: received 2 Apr 2010, last revised 27 Sep 2013

Contact author: jinhong at snu ac kr

Available format(s): PDF | BibTeX Citation

Version: 20130927:134403 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]