HOMEWORK > CMSC456—Introduction to Cryptography Professor Jonathan Katz-Homework 2—Solutions
University of Notre Dame ECON ECON 20010 Homework 2—Solutions 1. This is false. Consider modifying the one-time pad so encryption appends a bit that is 0 with probability 1/4 and 1 with probability 3/4. This scheme will still be perfectly secret, but ciphertexts ending in 1 are more likely than ciphertexts ending in 0. 2. (a) The scheme is not perfectly secr ...[Show More]
Preview 1 out of 2 pages
-preview.jpeg)
Reviews( 0 )
| Category: | |
| Number of pages: | 2 |
| Language: | English |
| Last updated: | 1 month ago |
| Downloads: | 0 |
| Views: | 0 |
-preview.jpeg)
-preview.jpeg)
-preview.jpeg)
-preview.jpeg)
