building 70, room 3657,
(585) 475-5193
spr@cs.rit.edu,
https://www.cs.rit.edu/~spr
Office hours:
in person TuWe 6:30pm-8pm, @70-3657,
on zoom (must prearrange time), or by email spr@cs.rit.edu
The course is devoted to the review of basic cryptographic algorithms, their implementations and usage. Classical encryption techniques and those of Diffie-Hellman and Rivest-Shamir-Adleman will be seen in depth, and an overview of several others will be presented, especially those denominated as public-key cryptosystems. The symmetric systems DES and AES, and others, will be studied. The course also presents digital signatures, hash functions, authentication schemes and some interactive proof protocols.
The specific topics will include:
1/14. Course logistics, this page. Start texbook Chapter 1.
1/16. Chapter 1. KMGTPE... kilo,mega,giga
1/21. Finish Chapter 1 slides.
Started cryptography overview
from spr's angle.
1/23.
Finished the above. Textbook slides 1-7 for Chapter 2.
1/28. Textbook slides 7-21 for Chapter 2.
1/30. Finish textbook slides for Chapter 2.
Modular arithmetic examples.
2/04.
Chapter 3 slides 1-19, DES.
2/06.
Finish Chapter 3. Breaking 2DES.
2/11.
More on DES and modes. Slides 1-22 for Chapter 5.
2/13.
AES, Chapter 4 slides.
2/18.
Finish Chapter 4 slides.
Zn[x], irreducible polynomials, fields.
2/20.
GF(256) in AES, fields,
GF(8), GF(9), small fields.
2/25.
GF(4).
All fields.
Closing Chapter 5, GCM-AES.
2/27.
MK-3 with large S-boxes
(pdf |
slides.pdf).
Start Chapter 6.
3/04. Midterm exam.
3/06. Class met on zoom. More Chapter 6.
Watch an
AES animation, and learn about Galois with
AES cartoons.
3/18. Chapter 6: Euclid Algorithm (EA),
Extended Euclid Algorithm EEA,
Euler function.
3/20. Euler and Fermat theorems. Square/multiply.
3/25. Chapter 7, up to RSA short public key.
3/27.
Chinese remainder theorem in RSA, CRT.
4/01.
Primes, Fermat primality test.
Miller-Rabin probabilistic primality test.
4/03.
Finish Chapter 7. Primality big picture,
AKS.
4/08.
DL-based protocols, DH, DHKE, ElGamal, Chapter 8.
4/10.
Elliptic curves, Chapter 9.
4/15.
OAEP,
gen2251.pdf,
other RSA recommendations.
Signatures, RSA, Chapter 10.
4/17.
DSA, finishing Chapter 10. Start hashing, Chapter 11.
4/22.
Hashing, Chapter 11.
4/24.
Birthday paradox, Chapter 11,
from MD5 to sha3.pdf (in particular slides 18-20).
other links