CryptoDB
Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-offs (Full version)
Authors: | |
---|---|
Download: | |
Abstract: | The time memory trade-off (TMTO) algorithm, first introduced by Hellman, is a method for quickly inverting a one-way function, using pre-computed tables. The distinguished point method (DP) is a technique that reduces the number of table lookups performed by Hellman's algorithm. In this paper we propose a new variant of the DP technique, named variable DP (VDP), having properties very different from DP. It has an effect on the amount of memory required to store the pre-computed tables. We also show how to combine variable chain length techniques like DP and VDP with a more recent trade-off algorithm called the rainbow table method. |
BibTeX
@misc{eprint-2008-17731, title={Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-offs (Full version)}, booktitle={IACR Eprint archive}, keywords={applications / time memory trade-off, Hellman trade-off, distinguished points, rainbow table}, url={http://eprint.iacr.org/2008/054}, note={The short version of this paper will appear in the proceedings of ISPEC 2008. jeongkc@math.snu.ac.kr 13924 received 1 Feb 2008, last revised 15 Feb 2008}, author={Jin Hong and Kyung Chul Jeong and Eun Young Kwon and In-Sok Lee and Daegun Ma}, year=2008 }