Making a Faster Cryptanalytic Time-Memory Trade-Off
Date: August 2003
Publication: Proceedings of Advances in Cryptology, Crypto '03 - Lecture Notes in Computer Science, Volume 2729
Page(s): 617 - 630
Source 1: http://lasecwww.epfl.ch/pub/lasec/doc/Oech03.pdf
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 (2 37 ) 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.
Do you have additional information to contribute regarding this research paper? If so, please email firstname.lastname@example.org with the details.