CS260: Resources | Saylor Academy

Topic	Name	Description
	Course Syllabus

© Saylor Academy 2010-2026 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See detailed licensing information. Saylor Academy®, Saylor.org®, and Harnessing Technology to Make Education Free® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Course Introduction

Course Syllabus

Unit 1: Introduction to Cryptography

1.1: Introduction to Encryption and Computational Security

1.2: Block Ciphers vs. Stream Ciphers

1.3: Substitution Cipher

1.4: Transposition Cipher

1.5: Random Numbers

1.6: Perfect Secrecy and the One-Time Pad

Unit 1 Assessment

Unit 2: Hash Functions

2.1: What Is a Hash Function?

2.2: Collision Resistance

2.3: Merkle-Damgard Construction

2.4: SHA (Secure Hash Algorithm)

2.5: Application: Blockchain

Unit 2 Assessment

Unit 3: Symmetric Encryption

3.1: Introduction to Symmetric Encryption

3.2: Feistel Cipher

3.3: Data Encryption Standard (DES)

3.4: Advanced Encryption Standard (AES)

3.5: Triple DES (3DES)

Unit 3 Assessment

Unit 4: Asymmetric Encryption

4.1: Asymmetric Cryptosystems

4.2: The RSA Cryptosystem

4.3: Integer Factorization

4.4: Congruences Modulo n

4.5: Euclidean Algorithm

4.6: Inverses Modulo p and the Extended Euclidean Algorithm

4.7: Fermat's Little Theorem and Its Generalization

4.8: Repeated Squaring Algorithm

4.9: The RSA (Rivest-Shamir-Adleman) Encryption System

Unit 4 Assessment

Unit 5: Signatures and Certificates

5.1: Message Integrity: Authentication, Confidentiality, and Nonrepudiation

5.2: Message Authentication Code (MAC)

5.3: Keyed Hash Functions

5.4: Digital Signatures and Certificates

Unit 5 Assessment

Unit 6: Key Management

6.1: Cyclic Groups

6.2: The Discrete Logarithm Problem

6.3: Diffie-Hellman Key Exchange

Unit 6 Assessment

Unit 7: Elliptic Curve Cryptography

7.1: Introduction to Elliptic Curves

7.2: Group Operations on Elliptic Curves

7.3: Elliptic Curve Cryptography Applications

Unit 7 Assessment

Unit 8: Zero-Knowledge Proofs

8.1: Introduction to Zero-Knowledge Proofs

8.2: SNARKS

8.3: Application: Ethereum

Unit 8 Assessment

Unit 9: Quantum Key Distribution

9.1: Photon Polarization

9.2: BB84 Protocol

9.3: Current Technology

Unit 9 Assessment

Unit 10: Quantum Algorithms

10.1: Quantum Operators

10.2: Quantum Search Problems

10.3: Shor's Algorithm

Unit 10 Assessment

Study Guide

Certificate Final Exam

Course Feedback Survey