ICS.202: Intro to Applied Cryptography
10/7/2016
Solutions to Homework 1
1
OTP Cipher Variants
1.1 Let S = cfw_00, 01, 10. Note that S is a set of 2-bit strings with string 11 missing.
Consider the following three OTP variants. For each of these OTP varia
CS.202: Intro to Cryptography
10/20/2016
Solution 3
Notation: Let a and b be bitstrings. a|b stands for the concatenation of a and b, |a|
stands for the bitlength of a, ai stands for the i-th bit of a, a[i,j] for i, j cfw_1, ., |a| s.t.
i j stands for aL
3.3
CS 201: Introduction to Cryptography
Fall Quarter, 2007
Instructor: Stanislaw Jarecki M-W, 3:30-5 ICS 243 ICS 6A and ICS 161/261, also see below Jonathan Katz, Yehuda Lindell,"Introduction to Modern Cryptography".
Class time: Room: Prerequisite
CS.202: Intro to Cryptography
10/20/2016
Solution 2
This homework will not count towards the grade, but should do it for the sake of
your own understanding, and you should do it this week because it guides you to gaining
some mental comfort with the notio
file:/C|/Documents%20and%20Settings/Linda%20Grauer/My%20Documents/Dolores/UC%20Irvine-Harvest/CS%20201/hmw1.htm
Homework 1: Due Monday, October 15 (or email me if you need time till Wednesday). First part: Chapter 2, problems 2.1, 2.2, 2.3, and 2.4.
ICS 201: Cryptography and Communication Security
10/22/2007
Homework 2
Due Monday, Oct 29, in class
Problem 1 and 2
Do exercises 3.2 and 3.4.
Problem 3
Consider a stateful encryption scheme, e.g. a stream cipher. Here both the encryption and the
ICS 201: Cryptography and Communication Security
10/19/2007
Solutions to homework 1
Problem 2.2
If encryption is secure then by Definition 2.1 this condition implies that P r[M = m] = P r[M = m ] for all m, m in the message space, which is obvious
CS.202: Intro to Cryptography
10/7/2016
Feasible Attack = Polynomial-time + non-negligible advantage
Will not grade solutions, but do it by Thursday, 10/13: Will release solutions then.
This homework will not count towards the grade, but should do it for