Introduction to Cryptography
CSCI46201, Fall 2022, Semester 2221
Instructor
building 70, room 3657,
(585) 4755193
spr@cs.rit.edu,
https://www.cs.rit.edu/~spr
office hours:
in person MoWeTh 6:30pm8pm 703657, or arrange by email
Lectures,
Tuesday/Thursday, 5:00pm6:15pm, room 703445
General Course Documents
Syllabus, outcomes, general course documents, policies, sample schedule:
college syllabus,
general schedule.
This page gives the current offering's contents, further links and schedule.
Books and Other Reading
 Christof Paar and Jan Pelzl,
Understanding Cryptography, SpringerLink, 2010
(required textbook).
Your
textbook website includes the textbook, textbookassociated
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.
 CryptoGram,
electronic newsletter by Bruce Schneier.
 Journal articles.
Prerequisites
General knowledge of programming.
Background in combinatorics and discrete mathematics.
(CSCI243 and MATH190, with B or better in both courses)
or permission of instructor. Students who complete CSCI462
may not take CSCI662 for credit.
Evaluation
 05% class participation
 45% homeworks
 20% midterm exam, Thursday, October 13, 703445, in class time
 30% final exam, Thursday, December 8, 703445, 7pm9:30pm
Contents
The course is devoted to the review of basic cryptographic
algorithms, their implementations and usage. Classical encryption
techniques and those of DiffieHellman and RivestShamirAdleman will be
seen in depth, and an overview of several others will be presented,
especially those denominated as publickey 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  SHAfamily, NIST competition.

Public key cryptography. Oneway functions.

RivestShamirAdleman cryptosystem  RSA. RSAxxx challenge.

Overview of ElGamal cryptosystem, discrete logarithms, digital signatures.
Main Online Resources
Schedule

Done in Fall 2022
8/23.
Course logistics, this page. Texbook chapter 1, slides 111.
8/25. Finish textbook slides for chapter 1. KMGTPE... kilo,mega,giga
8/30.
Started cryptography overview
from spr's angle.
9/01.
Finished the above. Textbook slides 16 for chapter 2.
9/06. Textbook slides for chapter 2.
Modular arithmetic examples.
9/08. Finish textbook slides for chapter 2.
Little more on
PRNGs from Stinson and CRC Handbook.
9/13. Finish PRNGs. Chapter 3 slides 112, DES.
9/15. Finish chapter 3.
9/20. Breaking 2DES.
More on DES and modes. Slides 121 for chapter 5.
9/22. AES, chapter 4 slides.
9/27.
Z_{n}[x], irreducible polynomials, fields.
9/29.
Fields, AES field GF(256),
GF(8), GF(4), more on fields.
10/04.
All fields.
Closing chapter 5, GCMAES. GF(9).
10/06. Sbox sizes.
MK3 with large Sboxes
(pdf 
slides.pdf).
Learn Spanish on
AES animation, and about Galois with
AES cartoons.
10/13. Midterm exam.
10/18. Chapter 6 slides.
10/20. Euclid algorithm (EA), EEA, Euler function.
10/25. Euler, Fermat and Lagrange theorems, order of elements,
examples.
10/27. Hints on midterm. Chapter 7 slides 113.
11/01.
Square/multiply,
RSA short public key, Chinese remainder theorem in RSA,
CRT.
11/03.
Primes, MillerRabin probabilistic primality test.
11/08.
More on MillerRabin test. Finish chapter 7.
OAEP.
11/10.
More on generators, gen2251.pdf.
AKS, factoring,
Pollard RHO.
11/15.
DLbased protocols, DH, DHKE, chapter 8.
11/17. Hashing, chapter 11 slides 113. Birthday paradox,
from MD5 to sha3.pdf (slides 1820).
11/22.
Finish chapter 11 slides. More hashing,
from MD5 to sha3.pdf.
11/29.
SHA3 finalists.
Signatures, RSA, DSA.
12/01.
DSA, ECDSA and bitcoin,
bitcoin signature.
Overview of textbook chapters 9 and 10.

Some of the following slides, beyond the textbook, are
used in the course. They will be pointed to as we go:
overview,
modtabs.txt,
expgcd.pdf,
prng.pdf,
desplus.pdf,
gf.pdf,
MK3 with large Sboxes (
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 1820),
SHA3 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.

PostQuantum Cryptography Program, NIST
report 8309, July,
CCC white paper, November 2020.

Common encryption types explained on CompariTech.
 The SHA3 Zoo.

Combinatorial Computing and Cryptography
in Gdańsk, November 2226, 2010.

TimeAI. Cryptogram 9/2019:
Their claims are nonsensical. Run away. Run, far, far, away.