Course Schedule (tentative)

Week of

 Lecture

 Readings & HWs

Jan

16

  Intro: basic definitions and examples.

Administrativia
Preliminaries section in Shoup, Ch.8 (scan for now - we will come back to it later in the course)

 

23

 Divisibility, Primality, GCD  ps1 due Jan.25;  Ch.1
Also recommended: NT1 or here

 

 Monday, January 29, 2007: Last Day to ADD Classes

 

30

    Modular arithmetics, Euclid's algorithm  ps2 due Feb.1
 Ch.2 (skip sec.2.6), 4.1

 

 

 

 Ch.3.1 - 3.3 (in sections)

Feb

6

   extended gcd algorithm, CRT algorithm  ps3 due Feb.8
Ch. 3.4; 4.2-3

 

Friday, February 16, 2007: Last Day to DROP Classes (without a 'W' grade), or to Change from Credit to Audit Status

 

13

 Putting it all together: RSA (public key cryptography)  ps4 due Feb.16 (4:30pm); Ch.7.4-9
  Tuesday, February 20, 2007: NO class (Monday schedule)

 

20

 Another application: error-correcting code Ch. 4.4-5

 

27

  Secret sharing  ps5 due March 1

 

 Friday, March 9, 2007: Last Day to DROP Classes (with a 'W' grade)

 

 

 

 

March

6

  Midterm - March 8  ps6 due March 8

 

 March 10-18, 2007: Spring Break

 

20

  Computing Square roots, Rabin encryption  Ch. 12-13

 

27

  Complexity of computing square roots. Applications. Fiat-Shamir protocol. ps7 due March 29

 

 

    

April

3

 Computing Legendre and Jacobi symbols.
Diffie-Hellman 		ps8 due April 5

 

10

 ElGamal, Discrete Log  ps9 due April 12; Ch. 11

 

17

  One-way and trap-door functions, Schnorr ZKP  ps10 due Apr. 20

 

24

  Rings  Ch. 9, ps11 due Apr. 26

 

 

    

May

1

  Polynomial rings; Summary  

 

 Classes end on Thursday, May 3, 2007

 

16

 Final: rescheduled Monday, May 14, 2-4 pm