lunduniversity.lu.se

# Details for the Course Syllabus for Course EDIN01F valid from Autumn 2018

General
Aim
• This course is intended to be an introduction to the fascinating subject of cryptography. It provides both a firm ground in the fundamentals and a feel for the subject for anyone interested either in carrying out cryptographic research or employing cryptographic security.
Contents
• Classical cryptography: Introduction and basic notation, The Caesar cipher, simple substitution, polyalphabetic ciphers (Vigenére, Kasiski’s method, Vernam), transposition ciphers, rotor machines (Enigma).
Shannon’s theory of secrecy: entropy, key and message equivocation, redundancy, unicity distance, perfect secrecy.
Shift register theory and stream ciphers: Finite fields, linear feedback shift register sequences, periods and cycle sets, shift register synthesis, nonlinear combinations of sequences, attacks on stream ciphers.
Block ciphers: Data Encryption Standard (DES), Advanced Encryption Standard (AES).
Public key cryptography: Basic number theory, RSA, Diffie-Hellman key exchange, factoring, primality, digital signatures.
Hash functions: properties, collision attacks, the birthday paradox
Authentication codes: Impersonation and substitution attacks.
Secret sharing: Shamir’s threshold scheme, general secret sharing, perfect and ideal schemes.
Projects: 1. Factoring. 2. Shift register sequences. 3. Correlation attacks.
Knowledge and Understanding
• For a passing grade the doctoral student must
• be able to describe different building blocks used in cryptology,
be able to describe the general problems that are addressed by cryptology,
be able to explain the principles behind different cryptographic primitives.
Competences and Skills
• For a passing grade the doctoral student must
• be able to provide descriptions of how cryptographic primitives can be used in security systems.
be able to show that you are capable to choose suitable parameters to cryptographic primitives as well as analyze various constructions from a security perspective.
Judgement and Approach
• For a passing grade the doctoral student must
Types of Instruction
• Lectures
• Project
Examination Formats
• Written exam
• Written exam and three mandatory projects.
• Failed, pass
Assumed Prior Knowledge
• A first course in programming. Basic mathemathics like linear algebra and probability theory.
Selection Criteria
Literature
• Stinson, D.: Cryptography, Theory and Practice. CRC Press. ISBN 1584882069.
Smart, Nigel P.: Cryptography Made Simple. Springer, 2016. ISBN 9783319219356.
• Lecture notes in cryptology (distributed by the department).
Further Information
• Course coordinator: Professor Thomas Johansson, thomas@eit.lth.se
Course code
• EDIN01F