(503557-3) Cryptography and Network Security

Homepage and Syllabus

Disclaimer

This is the best information available as of today, Wednesday March 15, 2023 at 2:00 a.m. KSA time. Changes will appear in this web page as the course progresses.

Meeting time and place

  • Section 1737: Monday and Wednesday 10:00 a.m. - 12:00 p.m.

Instructor: Dr. Emad Alsuwat

Course Homepage: https://emadalsuwat.github.io/cryptography-and-network-security-3rd-Trimester-2022-2023.html
Office: W101 CIT
Office hours: Sunday and Wednesday 2:00 p.m. - 4:00 p.m.
Phone: NA
Email: Alsuwat@tu.edu.sa

Course Overview

This course provides students with the most common cryptographic algorithms and protocols and how to use cryptographic algorithms and protocols to secure distributed applications and computer networks.

Learning Outcomes

By the end of the course, students will be able to:
  • Understand the Cryptography principles and types
  • Apply public key encryption methods
  • Secure the email and web servers
  • Describe the computer systems security issues.

Textbooks

Examinations

  • Midterm Exam: TBD
  • Final Exam: TBD

Grading

  • Midterm Exam: 25%
  • Homework Assignments and Project: 15%
  • Quizzes: 10%
  • Final Exam: 50%

Topics to be covered

Below are roughly the sections of the William Stallings book that I will cover. I may de-emphasize some topics and add others, but this is basically the list.

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(28)
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
Pseudorandom Number Generation and Stream Ciphers
  • Principles of Pseudorandom Number Generation
  • Pseudorandom Number Generators
  • Pseudorandom Number Generation Using a Block Cipher
  • Stream Ciphers
  • RC4
  • True Random Numbers
Chapter 7
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 CRYPTOGRAPHIC DATA INTEGRITY ALGORITHMS
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
Message Authentication Codes
  • Message Authentication Requirements
  • Message Authentication Functions
  • Message Authentication Codes
  • Security of MACs
  • MACs Based on Hash Functions: HMAC
  • MACs Based on Block Ciphers: DAA and CMAC
  • Authenticated Encryption: CCM and GCM
  • Pseudorandom Number Generation Using Hash Functions and MACs
Chapter 12
Digital Signatures
  • Digital Signatures
  • ElGamal Digital Signature Scheme
  • Schnorr Digital Signature Scheme
  • Digital Signature Standard (DSS)
Chapter 13
IP Security
  • IP Security Overview
  • IP Security Policy
  • Encapsulating Security Payload
  • Combining Security Associations
  • Internet Key Exchange
Chapter 19

Lecture Notes and Homework Assignments

Note that changes to the table below will appear week by week as the course progresses

Week Topic Slides Assignment Due Date
Week 1 Introduction Chapter 1 - -
Reading
only		 Classical Encryption Techniques Chapter 2 NOT Required NOT Required
Week 2 Block Ciphers and the
Data Encryption Standard 		Chapter 3 Homework 1 April 1, 2023
Week 3 Basic Concepts in Number Theory
and Finite Fields 		Chapter 4 - -
Week 4 Advanced Encryption Standard Chapter 5 Homework 2 May 6, 2023
Week 5 Block Cipher Operation Chapter 6 - -
Week 6 Midterm Exam
The exam will cover chapters
1, 3, 4, 5, and 6. 		- - -
Week 7
    Introduction to Number Theory
Chapter 8 - -
Week 8 Public Key Cryptography and RSA Chapter 9 Homework 3 June 7, 2023
Week 9 Other Public Key Cryptosystems Chapter 10 - -
Reading
only		 Cryptographic Hash Functions Chapter 11 NOT Required NOT Required
Week 10 Digital Signatures Chapter 13 - -
Week 11 IP Security Chapter 19 - -
Week 12 Final Exam - - -