Making a Faster Cryptanalytic Time-Memory Trade-Off

  • Philippe Oechslin
Conference paper

DOI: 10.1007/978-3-540-45146-4_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2729)
Cite this paper as:
Oechslin P. (2003) Making a Faster Cryptanalytic Time-Memory Trade-Off. In: Boneh D. (eds) Advances in Cryptology - CRYPTO 2003. CRYPTO 2003. Lecture Notes in Computer Science, vol 2729. Springer, Berlin, Heidelberg

Abstract

In 1980 Martin Hellman described a cryptanalytic time-memory trade-off which reduces the time of cryptanalysis by using precalculated data stored in memory. This technique was improved by Rivest before 1982 with the introduction of distinguished points which drastically reduces the number of memory lookups during cryptanalysis. This improved technique has been studied extensively but no new optimisations have been published ever since. We propose a new way of precalculating the data which reduces by two the number of calculations needed during cryptanalysis. Moreover, since the method does not make use of distinguished points, it reduces the overhead due to the variable chain length, which again significantly reduces the number of calculations. As an example we have implemented an attack on MS-Windows password hashes. Using 1.4GB of data (two CD-ROMs) we can crack 99.9% of all alphanumerical passwords hashes (237) in 13.6 seconds whereas it takes 101 seconds with the current approach using distinguished points. We show that the gain could be even much higher depending on the parameters used.

Keywords

Time-memory trade-off cryptanalysis precomputation fixed plaintext 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Philippe Oechslin
    • 1
  1. 1.Laboratoire de Securité et de Cryptographie (LASEC)Ecole Polytechnique Fédérale de Lausanne, Faculté I&CLausanneSwitzerland

Personalised recommendations