Variants of the distinguished point method for cryptanalytic time memory trade-offs

  • Authors:
  • Jin Hong;Kyung Chul Jeong;Eun Young Kwon;In-Sok Lee;Daegun Ma

  • Affiliations:
  • Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul, Korea;Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul, Korea;Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul, Korea;Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul, Korea;Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul, Korea

  • Venue:
  • ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.