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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hong, J., Jeong, K. C., Kwon, E. Y., Lee, I. S., & Ma, D. (2008). Variants of the distinguished point method for cryptanalytic time memory trade-offs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4991 LNCS, pp. 131–145). https://doi.org/10.1007/978-3-540-79104-1_10
Mendeley helps you to discover research relevant for your work.