This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ICS 268: Cryptography and Communication Security 9/28/2004 Homework 1 Due Tuesday, 10/5/2004, at the beginning of the class 1 Substitution cipher Have a look at the substitution cipher in Lecture Notes 1 (section 3.3) and recall the definition of perfect secrecy. Prove that the substitution cipher is perfectly secure for the special case of = 1, and that it it is not perfectly secure if 2. 2 OTP cipher variations Notation: We will denote by A n a set of nlong sequences of symbols A 1 A 2 ... A n where each A i is an element of A . For example, taking A = { , 1 } , we will write { , 1 } n to denote a set of all nlong binary strings. We showed that OneTime Pad encryption satisfies perfect secrecy if M = K = { , 1 } , for any . In this exercise we will look at variations of the OTP cipher, where the messages and/or keys are not any binary strings. For example, consider set S of three 2bit strings, S = { 00 , 01 , 10 } ....
View
Full
Document
This homework help was uploaded on 01/30/2008 for the course ICS 268 taught by Professor Jarecki during the Fall '04 term at UC Irvine.
 Fall '04
 Jarecki

Click to edit the document details