CS-458: Introduction to Cryptography (Fall 2024)


Schedule

Lesson Subject Book chapter*
1 The Context of Cryptography
  • The role of cryptography
  • The weakest link property
  • The adversarial setting
  • Threat model
  • Security and other design criteria
TB1.1
2 Classical Cryptosystems I
  • Substitution ciphers
    • Atbash, Caesar, Monoalphabetic, Homophonic, Book, Playfair
TB1.2
3 Classical Cryptosystems II
  • Substitution ciphers
    • Polyalphabetic, Vigenere, Running Key, Auto Key
  • Transposition ciphers
    • Scytale, Rail Fence, Columnar Transposition
  • Product ciphers
    • Rotor Machines, Enigma
TB1.2
4 One Time Pad
  • Index of Coincidence
    • Cryptanalysis of Vigenere
  • XOR Cipher
    • Principle, Properties, Attacks
  • One Time Pad
    • Principle, Attacks, Practical Issues
TB1.2
5 Cryptographic Attacks
  • Security Architecture
    • Threats, Vulnerabilities, Attacks, Risks, Security Mechanisms
  • Cryptographic attacks
    • COA, KPA, CPA, CCA, Distinguishing Attack, Brute Force, MiTM, Replay
Slides
6 Block Ciphers I: Symmetric Cryptography
  • Principles and algorithms
  • Block ciphers design
7 Block Ciphers II: Data Encryption Standard (DES)
  • Structure, strength and speed
8 Block Ciphers III: Triple DES (3DES)
  • Keying options, strength and speed
9 Block Ciphers IV: Advanced Encryption Standard (AES)
  • AES and other block ciphers
TB1.4
TB2.4
10 Block Ciphers V: Modes of operation
  • Padding
  • Block and stream modes
  • Increasing the security of block ciphers
TB2.5
11 Block Ciphers VI: Attacks
  • Brute force
  • Analytic and statistical
  • Attacks against the modes of operation
Slides
12 Public key cryptography I: Principles and applications
  • Symmetric vs. asymmetric cryptography
  • Practical aspects of public key cryptography
  • Public-key distribution
  • Digital signatures
  • Hybrid encryption
  • Algorithms
TB2.6
13 Introduction to Number Theory
  • Modular arithmetic
  • Euclidean and extended Euclidean algorithms
  • Euler's Phi Function
  • Fermat’s Little Theorem and Euler’s Theorem
  • Primality testing and factorisation
TB1.8
TB1.9
TB1.10
TB2.6
14 Public key cryptography II The RSA cryptosystem
  • The RSA cryptosystem
  • Proof of Correctness
  • Padding
  • RSA in practice
TB1.11
TB2.7
15 Public key cryptography III: Other PKC systems
  • Discrete Logarithm Problem based
  • Elliptic Curve based
  • Digital signatures
TB1.13
TB2.8
TB2.9
TB2.10
16 Public key cryptography IV: RSA attacks I
  • Factorization
  • Plain RSA attacks
17 Public key cryptography V: RSA attacks II
  • Protocol
  • Random number generation
  • Side-channel
  • Signature
Slides
18 Hash functions I: Principles and applications
  • Collisions
  • Birthday attack
  • Applications
TB1.5
19 Hash functions I: Algorithms
  • SHA-1/2/3
20 Hash functions II: Algorithms
  • Length Extension Attack
  • Cryptanalysis of hash algorithms
21 Message Authentication Codes
  • Principles and Applications
  • MACs from hash functions
  • MACs from block ciphers
  • Attacks
TB1.5
TB2.12
22 Key Managment
  • Key freshness and key derivation
  • Key establishment using symmetric-key techniques
  • Key establishment using asymmetric techniques
  • Key lifecycle
TB1.6
TB2.13
23 Applications of Cryptography
  • Secure data communications and storage
  • Security protocols (SSL/TLS, PGP, Tor)
  • Blockchain and cryptocurrencies
Slides
20 Quantum mechanics and cryptography
  • Quantum key distribution
  • Post-quantum cryptography
Slides

Book chapters: The course lectures will follow both recommended textbooks, chapters beginning with 1 refer to the textbook "Εισαγωγή στην Κρυπτογραφία" whereas chapters begining with 2 refer to the textbook "Understanding Cryptography, a textbook for students and practitioners".