DES uses a 56-bit key. Let's say you encrypt a message using single DES. With a 56-bit key there are 2^56 possible different keys. On average an attacker would only need to try half this number of keys to guess the correct key and break the system. If a cryptanalyst can try 1,000,000 keys per second, how long on average would it take to discover the key and recover the plaintext?
So there are a total of 256 different keys out of
which half will be tried
Which means that a total of 255 will be tested.
So in one second, we can test 1 000 000 keys
We need to find this in terms of
2x = 1000000
log22x = log21000000
x = 19.93
So 1000000 = 220
We need to open 255 patterns
each second can try 219.93 patterns
Total Time = 255 / 219.93
= 255 -
19.93
= 2 35.67 Seconds = 36067990609.81
Seconds
And this time is close to greater than 1100 years thus one would
not be able to open this encryption.
That was a nice
question to answer
Friend, If you have any doubts in understanding do let me know in
the comment section. I will be happy to help you further.
Please like if you think effort deserves a like.
Thanks
Get Answers For Free
Most questions answered within 1 hours.