(501513-3) Cryptography

Homepage and Syllabus

Disclaimer

This is the best information available as of Sunday Jan 18, 2026. Updates will appear here as the course progresses.

Meeting Time & Place

  • Section 596: Wednesday (Room 24221)

Instructor

Dr. Emad Alsuwat
Course Homepage: cryptography.html
Office: W101 CIT
Office hours: Please email me if you have any question. If necessary, I will arrange a phone call or a virtual meeting.
Email: Alsuwat@tu.edu.sa

Course Overview

This course provides students with an understanding of the fundamental concepts of cryptography and cryptanalysis. Starting with classical algorithms (and their cryptanalysis), the focus moves to modern cryptographic algorithms, primitives, and infrastructure. The course also introduces mathematical and probabilistic concepts used in cryptographic systems.

Learning Outcomes

  • Describe the classic encryption schemes and their cryptanalysis
  • Apply mathematics and probability theory to the design and analysis of modern cryptographic algorithms
  • Describe symmetric-key and public-key encryption and related infrastructure
  • Describe cryptographic primitives such as key exchange, primality testing, and zero-knowledge proofs

Textbook

  • Required: William Stallings, Cryptography and Network Security: Principles and Practice, 5th Edition, 2010

Grading Policy

Midterm Exam25%
Homework Assignments20%
Participation and Quizzes10%
Final Exam45%

Topics to be Covered

Below are roughly the sections of the William Stallings book that will be covered. Some topics may be de-emphasized and others may be added.

Topic Text Reference
Overview
  • Computer Security Concepts
  • Security Attacks
  • Security Services
  • Security Mechanisms
 Chapter 1
PART ONE: SYMMETRIC CIPHERS —
Classical Encryption Techniques
  • Symmetric Cipher Model
  • Substitution Techniques
  • Transposition Techniques
  • Rotor Machines
  • Steganography
 Chapter 2
Block Ciphers and the Data Encryption Standard
  • Block Cipher Principles
  • The Data Encryption Standard (DES)
  • A DES Example
  • The Strength of DES
  • Block Cipher Design Principles
 Chapter 3
Basic Concepts in Number Theory and Finite Fields
  • Divisibility and the Division Algorithm
  • The Euclidean Algorithm
  • Modular Arithmetic
  • Groups, Rings, and Fields
  • Finite Fields of the Form GF(p)
  • Polynomial Arithmetic
  • Finite Fields of the Form GF(2^n)
  • The Meaning of mod
 Chapter 4
Appendix 4A
Advanced Encryption Standard
  • The Origins AES
  • AES Structure
  • AES Round Functions
  • AES Key Expansion
  • An AES Example
  • AES Implementation
  • Polynomials with Coefficients in GF(2^8)
 Chapter 5
Appendix 5A
Block Cipher Operation
  • Multiple Encryption and Triple DES
  • Electronic Codebook Mode
  • Cipher Block Chaining Mode
  • Cipher Feedback Mode
  • Output Feedback Mode
  • Counter Mode
  • XTS Mode for Block-Oriented Storage Devices
 Chapter 6
PART TWO: ASYMMETRIC CIPHERS —
More Number Theory
  • Prime Numbers
  • Fermat’s and Euler’s Theorems
  • Testing for Primality
  • The Chinese Remainder Theorem
  • Discrete Logarithms
 Chapter 8
Public-Key Cryptography and RSA
  • Principles of Public-Key Cryptosystems
  • The RSA Algorithm
 Chapter 9
Other Public-Key Cryptosystems
  • Diffie-Hellman Key Exchange
  • ElGamal Cryptosystem
  • Elliptic Curve Arithmetic
  • Elliptic Curve Cryptography
  • Pseudorandom Number Generation Based on an Asymmetric Cipher
 Chapter 10
PART THREE: DATA INTEGRITY —
Cryptographic Hash Functions
  • Applications of Cryptographic Hash Functions
  • Two Simple Hash Functions
  • Requirements and Security
  • Hash Functions Based on Cipher Block Chaining
  • Secure Hash Algorithm (SHA)
  • SHA-3
 Chapter 11
Digital Signatures
  • Digital Signatures
  • ElGamal Digital Signature Scheme
  • Schnorr Digital Signature Scheme
  • Digital Signature Standard (DSS)
 Chapter 13

Lecture Notes & Homework

Week / Date Topic Slides Assignment Due Date
Week 1
21/01/2026		 Syllabus Week -
Week 2
28/01/2026		 Introduction Chapter 1
Week 3
04/02/2026		 Classical Encryption Techniques Chapter 2
Week 4
11/02/2026		 Block Ciphers and the
Data Encryption Standard		 Chapter 3
Week 5
18/02/2026		 Basic Concepts in Number Theory
and Finite Fields		 Chapter 4
Week 6
25/02/2026		 Advanced Encryption Standard Chapter 5
Week 7
04/03/2026		 Block Cipher Operation Chapter 6
Week 8
11/03/2026		 Introduction to Number Theory Chapter 8
Week 9
18/03/2026		 Midterm Exam
The exam will cover chapters
1, 2, 3, 4, 5, 6, and 8.		 -
Week 10
25/03/2026		 Public Key Cryptography and RSA Chapter 9
Week 11
01/04/2026		 Other Public Key Cryptosystems Chapter 10
Week 12
08/04/2026		 Cryptographic Hash Functions Chapter 11
Week 13
15/04/2026		 Digital Signatures Chapter 13