Data Protection and Security |
||||||
I |
Introduction To Cryptography |
|||||
I.IV |
One-Time Pad |
|||||
Perfect Secrecy Computationally secure: The most efficient known algorithm for breaking a cipher would require far more computational steps than any hardware available to an opponent can perform. Most crypto algorithm in use today are computationally secure. Unconditionally secure: The opponent has not enough information to decide whether one plaintext is more likely to be correct than another, even if unlimited computational power were available. |
||||||
I.IV.Q |
[+] Question
[-] QuestionIs it true to say that it is necessary but insufficient to have a large key space in order to have computational security? |
|||||
|
||||||
|
concepts » | |||||