Question: At first glance it seems as though an exhaustive key search is possible against an OTP system. Given is a short message, lets say 5
At first glance it seems as though an exhaustive key search is possible against an OTP system. Given is a short message, let’s say 5 ASCII characters represented by 40 bit, which was encrypted using a 40-bit OTP. Explain exactly why an exhaustive key search will not succeed even though sufficient computational resources are available. This is a paradox since we know that the OTP is unconditionally secure.
Step by Step Solution
3.44 Rating (160 Votes )
There are 3 Steps involved in it
Bruteforce attack do not work on OTP system as if we implement a dictionary attackinfinite computing ... View full answer
Get step-by-step solutions from verified subject matter experts
