At first glance it seems as though an exhaustive key search is possible against an OTP system.
Fantastic news! We've Found the answer you've been seeking!
Question:
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.
Related Book For
Business Communication
ISBN: 978-1439080153
8th edition
Authors: Buddy Krizan, Patricia Merrier, Joyce P. Logan, Karen Schneiter Williams
Posted Date: