School of Informatics - 2021/22

Course Information

Content

  • Item

    Course Summary

    Introduction to Modern Cryptography (IMC) is a 10 credit course at Level 11, normally taken in Year 4. It runs in Semester 2. The exam is in April/May, and is worth 70% of the course mark. The University descriptor is here.
  • Item

    Course Outline

    The course is divided in two parts: private key and public key. Topics covered in the private key part are: classical ciphers (Caesar, Vigenere), one-time pad and perfect secrecy, computational secrecy, pseudorandom functions and permutations, CPA security, CCA security and proofs by reduction. The following topics are also briefly discussed: block ciphers, modes of operation, message integrity, hash functions and MACs. In the public key part we cover: hard computational problems such as factoring and discrete log, the Diffie-Hellman key exchange protocol, ElGamal and digital signatures. Other topics that may also be discussed (depending on time) are: zero-knowledge proofs, Schnorr Identification, commitment schemes and oblivious transfer protocols. A tentative outline of the material is given below.

    Part 1: Private Key

    - Classical ciphers: Shift cipher, Vigenere
    - Perfect secrecy
    - One-time pad (OTP)
    - Computational secrecy
    - Pseudorandom generators (PRG)
    - Pseudo-OTP
    - Security against chosen-plaintext attacks (CPA)
    - Pseudorandom functions / permutations (PRF / PRP)
    - CPA-secure encryption using PRF/PRP: block ciphers
    - Modes of operation: block ciphers, stream ciphers
    - Malleability
    - Security against chosen-ciphertext attacks (CCA)
    - Padding-oracle attacks: non-CCA secure schemes
    - Secrecy vs. integrity: message authentication codes (MAC)
    - Hash functions

    Part 2: Public Key

    - Digital Signatures
    - Trapdoor One-Way functions
    - Random oracles
    - Cyclic groups
    - The discrete logarithm/Diffie-Hellman assumptions
    - Key exchange and the Diffie-Hellman protocol
    - Public Key Encryption
    - Security against chosen-plaintext attacks
    - ElGamal Encryption
    - Zero-Knowledge proofs
    - The Schnorr identification scheme

  • Item

    Timetable

    If you are looking for your class times for this course, these can be found via your University of Edinburgh calendar (links provided below):
  • Item

    Informatics Teaching Organisation: Information for Students

    You can also email the Informatics Teaching Organisation (ITO) at ito@inf.ed.ac.uk  or the Student Support Team (SST) at inf-sst@inf.ed.ac.uk.