Lecture-5-17-10

Lecture-5-17-10 - H(K| C = H(K H(M H(C Recall two basic...

This preview shows pages 1–11. Sign up to view the full content.

Achieving Perfect Secrecy We have Perfect Secrecy when the ciphertext gives no information about the plaintext A random cryptographic system Thus the number of keys must be at least as large as the number of ciphertexts for a fixed key --> different plaintexts must go to different ciphertexts C yields no information about M means that M and C are independent Random Variables Thus the number of ciphertexts must be at least as large as the number of plaintexts next

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
The Ciphertext is independent of the plaintext thus the Ciphertext gives no information about the plaintext Q.E.D. next
How to construct perfect secrecy systems In the simplest case Solution: Ciphertexts Show that this wheel gives a perfect secrecy system Sample quiz problem next next

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
next next
next next

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
For the known plaintext attack we have H(K| C,M ) = H(K) - H(C|M )

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: H(K| C) = H(K) + H(M) - H(C) Recall two basic equations next next next Recall the experiment we carried out in class ? The sequence that gave the number of guesses for each letter may be viewed as an encoding of the sentence next The Unicity distance The least amount of ciphertext the opponent needs to know to uniquely recover the plaintext = 0 ? next The unicity distance equation then becomes Computation of the Unicity Distance for monoalphabetic ciphers Thus the encryption of such a message will use only 14 letters of the permuted alphabet and we get In conclusion: for a monoalphabetic cipher 23 characters of ciphertext should be sufFcient to uniquely determine the plaintext next SAMPLE PROBLEMS next Sample quiz problems 1 2 next next next...
View Full Document

{[ snackBarMessage ]}

What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern