Library
Exercises
Games
Exams
Resources
Forum
News
Light
Log in
Sign up
Library
Exercises
Games
Exams
Resources
Forum
News
All courses
Library
The one-time pad and perfect secrecy
Unbreakable, really?
MCQ
Why does the one-time pad remain unbreakable even against an attacker with infinite computing power?
Possible answers
Because the XOR operation is too slow for a machine to invert
Because trying every key produces every possible plaintext, with no way of recognising the right one
Because the key is protected by an additional password
Because the ciphertext is shorter than the key
Log in to reply
Exercise 1 of 4
Next exercise
Report a mistake or suggest an improvement