Tel Aviv University School of Computer Science
Class BulletinBoard:
Date 
Announcement 
January 29 
Assignment 1 was launched. 
February 3  Lecture 3 has two online presentations  math and crypto. 
February 5  Updated versions of both parts of lecture 3 were uploaded. Mostly they contain fixes to minor bugs, but on the AES part a slightly expanded explanation of culomn mixing is included. 
February 5  Students who have exams in the current week (Feb 38) can submit HW1 till Sunday, Feb 17 (together with their partners if applicable). The submitted homework should, in addition, include some printouts confirming registration to a course and exam date(s). Students who have exams in the week of Feb 1015) should send email to Benny Chor and indicate the date(s) of these exams, in order to obtain a slightly extended extension. 
February 16  The first makeup class will take place on Friday, Feb. 22, 1013, in Dan David 003. A follow up session (optional) will be held subsequently in the outside swimming pool, rain or shine! 
March 10  On March 11, we will again start at 9am. Following a number of requests, I will devote the first hour to going over material from lecture 3 dealing with the algebraic components of the class (finite groups, rings, and fields). If you feel this is of little or no help to you, you are welcome to show up at 10:05. 
Contact Info:  

Prerequisites
Linear Algebra; Probability; Algorithms (formerly
“efficiency of computations”); Computational
Models,
and most importantly, "mathematical maturity".
Course Outline
This course will discuss basic building blocks of modern cryptography.
Tentative
topics include encryption,
data integrity, authentication and identification, digital
signatures, elementary number theory, randomness
and pseudorandomness, cryptographic protocols, and real world security
systems.
Course Plan (will be updated incrementally):
Typically each lecture will have two major parts. The "crypto part" will be presented with slides, while the "mathematical background" (number
Lecture
___________Date
______Crypto Subject
______________________________________Mathematics Background
_______________________Textbook Reference
__________________1
22/1/0823/10/08 Elementary introduction to Modern Crypto;
Administrativia, course topics, etc.
Groups, rings, fields;
The ring Z_{N };
Euler's totient (phi) functionStinson 1.1.1
Shoup 2.12.4; 3.13.42 29/1
Pseudo random generators and permutations. Symmetric Stream and Block Ciphers
and their modes of operation
Euclid gcd algorithm, extended gcd.
Groups and subgroupsStinson 3.7
KatzLindell 3.3, 3.4, 3.6
3
5/2
Symmetric block ciphers: DES and AES
Groups, Rings, Finite fields Stinson 3.1, 3.4, 3.5, 6.4
KatzLindell 5.3, 5.5, 7.14 12/2 Iterated Ciphers;
Message Authentication;
Cryptographic Hash Functions.
Stinson 4.2.1
KatzLindell 4.14.7, 5.45 19/2 Extended gcd; Time analysis
of the Euclid gcd algorithm;Stinson 5.2.1, 5.4
KatzLindell 7.1, 7.3, 9.4, 11.16 Friday22/2
Chinese remainder theorem Stinson 5.2, 5.4, 5.3
KatzLindell 7.2, 10.47 26/2 RSA public key cryptosystem
Stinson 5.3, 5.5, 5.6 KatzLindell 7.2, 8.1 8 (and 1/3) 4/3 Solutions to PS1
Factoring Algorithms:
Pollard rho methodStinson 5.3, 5.5,5.6,6.1
KatzLindell 7.2, 8.1,10.4,10.59 (and 2/3) 11/3 Elgamal Public Key Cryptosystem
Digital Signatures
Groups, Rings, Finite fields
Discrete Log Algorithms: 1.Shank's babystep giantstep
Coin flipping over the phoneStinson 6.16.2, 7.17.4
KatzLindell 8.2, 10.5, 12.112.4, 12.710 (and 2/3) 18/3 Discrete Log Algorithms:
2. Pollard rho method
(Maple code  updated 17/3)
Stinson 5.9, 6.2, 6.7.1
KatzLindell 6.3, 8.211 (and 2/3) 25/3
1/1/08Zero knowledge proofs: 3 coloring
(Slides by Maurice Herlihy, Brown University)
Identification Schemes.
noutofn secret sharing schemes (maybe)
Solution to Assignment 2 (certainly)
שיעור חזרה 27/3
3pm
Solution to Assignment 3
Solution to Moed A, 2002
Homework Assignments
Assignment 
Date Handed 
Submission Deadline^{*} 
Remarks 
January 29, 2008 
February 12  
February 17, 2008 
March 4 

March 10, 2008 
March 25 









Homework submition in singles or pairs. There will be a
total of 45 problem sets, involving both "dry" assignments
and 12 assignments with a "wet" component (involving small MAPLE
programs).
The homework portion of the grade is determined by the the weighted average of all
assignments.
R. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and PublicKey Cryptosystems", CACM 21, pp. 120126, Feb. 1978.
A. Shamir, "How to
Share a Secret", CACM 22, pp. 612613, November 1979.