Applying time-memory-data trade-off to plaintext recovery attack

Abstract

In this paper, we propose a new attack for block ciphers by applying the well known time-memory-data (TMD) trade-off to plaintext recovery attack (PRA), thus creating two new schemes: TMD-PRA-I and TMD-PRA-II. Compared with the traditional trade-off attacks, these two schemes possess several robust properties which can greatly increase the success probability and enhance the process of analysis. We also evaluate the performance of our schemes by applying them to several block ciphers like DES, Triple-DES, Skipjack and AES. Results show that they have favourable performance especially when the key size is larger than the block size, which gives us a reminder that PRA based on TMD trade-off should be considered when designing a new cryptographic scheme. © 2012 Springer-Verlag.