Note: this information is a mirror of the information in LiU's e-learning system lisam.
This first course in cryptology gives an overview of existing algorithms and the requirements they should meet. Some algorithms are treated in depth while others are treated more at an introductory level, a detailed list over the course content can be found here.
The course is given in period HT1. The literature and lectures are in English, as are the training lessons.
Algebra and Probability Theory. TSIT02 Computer Security and Discrete mathematics are recommended.
|Jan-Åke Larsson||B building, entr 27-29, 1st floor, A-corr, firstname.lastname@example.org||Lectures, examination|
|Jonathan Jogenfors||B building, entr 27-29, 1st floor, A-corr, email@example.com||Lab sessions|
|Niklas Johansson||B building, entr 27-29, 1st floor, A-corr, firstname.lastname@example.org||Pubkey||Lab sessions|
Course book: "Introduction to Cryptography with Coding Theory" by Wade Trappe and Lawrence Washington.
|Item||Content||Trappe & Washington|
|Lecture 1||History and principles||Ch 2.1-2.6, 2.8, 2.12|
|Remember to register for the lab sessions!|
|Lecture 2||Foundations and basic theory||Ch 15, 2.9|
|Lecture 3||Stream ciphers, pseudo-randomness||Ch 2.10-2.11|
|Lecture 4||Block ciphers: Principles, DES||Ch 2.7, 4.1-4.4, 4.6-4.7|
|Lecture 5||Block ciphers: AES, other algorithms, modes, MACs||Ch 5, *3.11, 4.5, 4.8, (+MACs)|
|Lab 1||Historical ciphers||Lab-PM 1|
|Lab 2||Hacking DES via side-channel analysis||Lab-PM 2|
|Lecture 6||One-way functions, public key principles, RSA||Ch 3.1-3.6, 3.9, 6.1, 6.7|
|Lecture 7||RSA continued, crypto knapsack, Diffie-Hellman, ElGamal||Ch 6.2-6.4, 7.1-7.2, 7.4-7.5, (+knapsack)|
|Lecture 8||Digital signatures and hash functions||Ch 8, 9|
|Lab 3||GnuPG||Lab-PM 3 + sig|
|Lecture 9||Quantum cryptography||Ch 19.1-2, + more|
|Lecture 10||Elliptic Curve Cryptography, key distribution and trust||Ch 16.1, 16.5, and 10|
|Lab 4||Quantum Cryptography||Lab-PM 4|
|Lecture 11||Zero knowledge and Secret sharing||Ch 7.3, 12, 14|
|Lecture 12||SET, Bitcoin, Blockchain||Not Ch 11|
At course start you should sign up for the four compulsory sessions within lisam. Please note that you must have made all preparations before your lab session starts. The laboratory work is organised so that each participant should come to the laboratory fully prepared with full knowledge of what should be done and a personal plan for what should be tried and in what way. The lab is done in pairs of two students.
TSIT03 requires knowledge of the contents of the course notes and the parts of the book according to the instructions in "Course contents". But you are not required to remember every detail by heart.
Only the algorithms mentioned in the course instructions are part of the course. For these, only the structure is required knowledge. Tables, including tables of which bit ends up where in key transformations etc., are not required knowledge.
For asymmetric ciphers you must know the basic calculations for key generation and distribution and for encryption and signing, but detailed knowledge of the formula for adding two points on an elliptic curve is not required.
For pseudorandom number generators, you are not required to
reconstruct Berlekamp-Massey, just to know what it is and what it is
used for. Also knowledge of what kind of sequences primitive and other
polynomials create is required, but you are not required to create new
polynomials giving exactly a stated period. Basic knowledge of the
effects of non-linear combinations of linear sequences is also
required, especially correllation.
Page responsible: Jan-Åke Larsson
Last updated: 2017-04-25