Introduction to Cryptography
CSCI-462-01, Fall 2024, Semester 2241

Instructor

Stanisław Radziszowski

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 and Fr 1pm-2pm, @70-3657,
on zoom (must prearrange time), or by email spr@cs.rit.edu

Lectures, Tuesday/Thursday, 5:00pm-6:15pm, room 70-1435

General Course Documents

Books and Other Reading

• Christof Paar and Jan Pelzl, Understanding Cryptography, SpringerLink 2010, first edition. Christof Paar, Jan Pelzl and Tim Güneysu, Understanding Cryptography, from Established Symmetric and Asymmetric Ciphers to Post-Quantum Algorithms, Springer 2024, second edition (required textbook, preferred second edition). Your textbook website includes the textbook, textbook-associated slides and videos of lectures. For additional slides used in this course see links below in Online Resources.
• Douglas R. Stinson and Maura B. Paterson, Cryptography: Theory and Practice, CRC Press, fourth edition 2019.
• A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, CRC Handbook of Applied Cryptography, CRC Press 1996/2001 (great addition to your bookshelf.)
• Niels Ferguson, Bruce Schneier and Tadayoshi Kohno, Cryptography Engineering, John Wiley & Sons 2010 (complementary reading.)
• William Stallings, Cryptography and Network Security. Principles and Practice, Prentice Hall, seventh edition 2018 (popular textbook elsewhere.)
• Simon Singh, The Code Book, the evolution of secrecy from Mary, Queen of Scots, to quantum cryptography, Doubleday 1999.
• Crypto-Gram, electronic newsletter by Bruce Schneier.
• Journal articles.

Prerequisites

Evaluation

• 08% class participation
• 42% homeworks
• 20% midterm exam, Thursday, October 17, 70-1435, in class time
• 30% final exam, Thursday, December 12, 70-1435, 7pm-9:30pm

Contents

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:

• Introduction, need of security. History.
• Substitution and monoalphabetic ciphers.
• Vigenere cipher, coincidence index.
• A touch of number theoretical algorithms.
• Private key cryptography.
• Data Encryption Standard - DES.
• Rijndael, Advanced Encryption Standard - AES.
• Secure hashing algorithms - SHA-family, NIST competition.
• Public key cryptography. One-way functions.
• Rivest-Shamir-Adleman cryptosystem - RSA. RSA-xxx challenge.
• Overview of ElGamal cryptosystem, discrete logarithms, digital signatures.

Main Resources

• Your textbook website (includes the main slides shown in class).
• Many video lectures by the textbook's authors.
• Some tutoring is available.
• Some video lectures by Professor Monika Polak at RIT.

Schedule

• Done so far in Fall 2024

  8/27. Course logistics, this page. Start texbook chapter 1.
  8/29. Chapter 1. KMGTPE... kilo,mega,giga
  9/03. Finish Chapter 1 slides. Started cryptography overview from spr's angle.
  9/05. Cryptography overview continued.
  9/10. Finished the above. Textbook slides 1-14 for chapter 2.
  9/12. Finish textbook slides for chapter 2.
  9/17. Modular arithmetic examples. More PRNGs. Chapter 3 slides, DES.
  9/19. Finish chapter 3.
  9/24. Breaking 2DES. More on DES and modes. Slides 1-21 for chapter 5.
  9/26. AES, chapter 4 slides.
  10/01. Finish chapter 4 slides. Z_n[x], irreducible polynomials, fields.
  10/03. GF(256) in AES, fields, GF(4).
  10/08. GF(8), GF(9), small fields. All fields. Closing chapter 5, GCM-AES. GF(9).
  10/10. MK-3 with large S-boxes (pdf | slides.pdf). Watch an AES animation, and learn about Galois with AES cartoons.
  10/17. Midterm exam.
  10/22. Chapter 6 slides 1-20.
  10/24. Chapter 6: Euclid Algorithm (EA), Extended Euclid Algorithm EEA, Euler function.
  10/29. Euler and Fermat theorems. Square/multiply.
  10/31. Chapter 7 slides 1-15, RSA short public key.
  11/05. Chinese remainder theorem in RSA, CRT.
  11/07. Primes, Fermat primality test.
  11/12. Miller-Rabin probabilistic primality test. Finish chapter 7. Primality big picture, AKS.
  11/14. OAEP, other RSA recommendations. DL-based protocols, DH, DHKE, chapter 8, 1-10.
  11/19. Generators (primitive elements), gen2251.pdf. Finish chapter 8.
  

• Done in Fall 2023
  11/28. Signatures, RSA, DSA, chapter 10.
  11/30. Finish chapter 10. Hashing, chapter 11.
  12/05. Birthday paradox, chapter 11, from MD5 to sha3.pdf (slides 18-20).
  12/07. More hashing. SHA-3 finalists.

  other links

• Some of the following slides, beyond the textbook, are used in the course, pointed to as we go: overview, modtabs.txt, expgcd.pdf, prng.pdf, desplus.pdf, gf.pdf, MK-3 with large S-boxes ( pdf | slides.pdf), gen2251.pdf, crt.pdf, primes.pdf, AKS.pdf, oaep.pdf, cts.jpg, rho.pdf, from MD5 to sha3.pdf (look closely at slides 18-20), SHA-3 finalists, signatures in bitcoin bitsign.pdf, knap.pdf.

Other Online Resources

• Some lectures by Scott Aaronson on Quantum Computing Since Democritus, in particular Lecture 8: Crypto.
• Post-Quantum Cryptography Program, NIST report 8309, July, CCC white paper, November 2020.
• Common encryption types explained on CompariTech.
• Combinatorial Computing and Cryptography in Gdańsk, November 22-26, 2010.
• CSCI-764 course on Quantum-Resistant Cryptography.
• TimeAI. Cryptogram 9/2019: Their claims are nonsensical. Run away. Run, far far away.