Time Memory Tradeoff Attack On Triple Data Encryption Standard Triple-DES

Abstract

The time of innovation opens the need of security in our generation and if we consider the pace of time at which it is changing, technology is also becoming more prone to security breach and various online or network attacks. Everybody usually likes an immediate, exact, quick and simple answer for the issues of almost every kind so it is also a greater need to speed up the techs along with its security. Now to this level of security, we have introduced the concept of triple DES algorithm which consider to be one of most secure algorithm in the today’s world. However, there is one problem with this algorithm which is its speed of encryption and decryption. So, in order to speed this algorithm up, we modified this algorithm by storing some precomputed values and divided its work by time and storage sharing formula. Now in order to check its vulnerability, we had an attack on triple DES which is Time memory data trade off attack. This attack is based on the balance between time and memory to find the key pair corresponding to the given ciphertext. This attack is very efficient and is not restricted to only cryptography but also it has some other applications too. However, in this attack, there are some anomalies also, that is why, we used the concept on rainbow tables to make ourselves ensure that there should not be any repetition in the chaining process.