m~"1c.
fur
CJ~? h>Sy5~
Ovt~v\S
,
I
i
D (\
l)
~ .d
:s J
01\
s. t.
:"P"\ 5,
~
~
~A.A MCSS 4
Me"
L
(i?~.,.ltxtS
cJ : :
o.f\~;+"ll\tJ
'1;15
Dvtp01 by
f:!vJ
fe'"
t:l.OOJt
f'roYl
.
.
\d
tv\.

S/!f.J.J(; T'f :
he.
oJ\1
f"<. e. M
~
1<:1\:/+"
It:. f'D5 Si \:
ME ~~¢L1::2..f$ COW m
7!
{Ammo Q  Y5
EASY ID COM?UXC% My r Q
:thwxsgnv
L5?
aim/:0
3 why might >339 win};
gimk
g.
gammgkl 0wF 5i
@ mau; W E
1'5
{Judah} ; k u 'I ~\\ 7
f w M (106:. jrmvn Mam»
. ,yg \ a Sh 1
"Mm ig; 3 he
CS151: Intro to Cryptography and Computer Security
Jan 28, 2014
Homework 1
Instructor: Anna Lysyanskaya
Due: Feb 4, 2014
Problem 1: True/False: This is a true/false problem.
Your friends Alice and Bob are both talented testtakers, but they can sometimes
CS151: Intro to Cryptography and Computer Security
April 30th, 2014
Final Exam
Instructor: Anna Lysyanskaya
Due: May 7, 2014
This is a noncollaborative assignment. You may not discuss the problems with any
other students and you may not use any resources
CS151: Intro to Cryptography and Computer Security
February 4, 2013
Homework 2 Solutions
Instructor: Anna Lysyanskaya
Due: February 11, 2013
Problem 1: Negligible functions
a. A function like (k) = 2k is certainly negligible, and also always positive.
b.
CS151: Intro to Cryptography and Computer Security
Jan 28, 2014
Homework 1 Solutions
Instructor: Anna Lysyanskaya
Due: Feb 4, 2014
Problem 1: True/False: This is a true/false problem.
a. Any percentage between 33.3%  50% would achieve this.
As an example
CS151: Intro to Cryptography and Computer Security
February 5, 2014
Homework 2
Instructor: Anna Lysyanskaya
Due: February 11, 2014
Problem 1: Negligible Functions
In cryptography, we usually dene security by requiring that the probability of some undesira
CS151: Intro to Cryptography and Computer Security
Feb 28, 2014
Homework 4 Solutions
Instructor: Anna Lysyanskaya
Due: Mar 6, 2014
Problem 1: Adaptive Security
a. (Solution by Nicolas Schank.) We can construct such a cryptosystem (G , E , D ) in the
follo
CS151: Intro to Cryptography and Computer Security
Feb 18, 2014
Homework 3
Instructor: Anna Lysyanskaya
Due: Feb 25, 2014
Problem 1: The Extended Euclidean GCD Algorithm
On input integers x and y, the extended Euclidean GCD algorithm nds integers a and b
CS151: Intro to Cryptography and Computer Security
April 21, 2014
Homework 8  Solutions
Instructor: Anna Lysyanskaya
Due: April 28, 2014
Problem 1: Broken Signatures
a. We want to show that if factoring is hard, it is also hard to make the scheme target
CS151: Intro to Cryptography and Computer Security
April 1, 2014
Homework 6  Solutions
Instructor: Anna Lysyanskaya
Due: April 8, 2014
Problem 1: Pseudorandom Fun(ctions)
We know that we want the output of Fs (x) to be of the form y0 y2 . . . yk1 , where
CS151: Intro to Cryptography and Computer Security
March 18, 2014
Homework 5 Solutions
Instructor: Anna Lysyanskaya
Due: April 1, 2014
Problem 1: Fun with PRGs
a. This is a PRG. Suppose that Ga (s) is not a PRG then there exists an adversary A that
distin
CS151: Intro to Cryptography and Computer Security
Feb 28, 2014
Homework 4
Instructor: Anna Lysyanskaya
Due: Mar 6, 2014
Problem 1: Adaptive Security
Recall the denition of secure publickey encryption that we saw in class.
Denition 1. A cryptosystem (G,
CS151: Intro to Cryptography and Computer Security
Mar 18, 2014
Homework 5
Instructor: Anna Lysyanskaya
Due: Apr 1, 2014
Problem 1: Fun with PRGs
Let G, G1 , G2 : cfw_0, 1n cfw_0, 12n be PRGs (for every n), and let s, s1 , s2 cfw_0, 1k . For each of the
f
CS151: Intro to Cryptography and Computer Security
April 10, 2014
Homework 7  Solutions
Instructor: Anna Lysyanskaya
Due: April 17, 2014
Problem 1: Damaging a CCASecure Cryptosystem
a. As always, we prove this using a reduction. In this case, we assume