Cryptography Triple Des question An attacker has obtained a

Cryptography Triple Des question:

An attacker has obtained a small number of plaintet-ciphertext pairs encrypted using 2-key Triple-DES. The attacker intends to use these pairs to mount an exhaustive keysearch attack.

(Note that a meet-in-the-middle attack is not possible here, since for a 2-key Triple-DES, a meet-in-the middle attack requires a large number of known plaintext-ciphertext pairs.)

How many encryptions does the attacker expect to have to carry out before finding the correct key?

The attacker is using a specially-built 2-key Triple-DES Cracker, which is capable of performing 10^18 encryptions per second. How long do you expect that the attacker will have to wait before the correct key is foundGive the answer to the nearest year.

Solution

the velocity of exhaustive key searches towards DES after 1990 started out to reason pain among users of DES. but, users did not need to update DES as it takes an enormous quantity of money and time to trade encryption algorithms which can be extensively followed and embedded in huge security architectures.

The pragmatic method turned into now not to desert the DES absolutely, but to exchange the manner wherein DES is used. This caused the modified schemes of Triple DES (every now and then referred to as 3DES).

incidentally, there are two variants of Triple DES called three-key Triple DES (3TDES) and a couple of-key Triple DES (2TDES)