Göm meny

Note: this information is a mirror of the information in LiU's e-learning system lisam.

TSIT03 Kryptoteknik

Denna grundkurs i kryptoteknik ger övergripande kunskap om vilka typer av algoritmer som finns och vilka krav man måste ställa på dem. Vissa algoritmer behandlas i detalj medan andra gås igenom mera översiktligt, en mera detaljerad lista över kursinnehållet finns här.

Kursen ges under period HT1 och ingår som valfri i flera långa program. Den är obligatorisk för D-profilen om säkerhet. Observera att föreläsningarna och övningarna hålls på engelska. Under laborationerna kan man naturligtvis använda svenska. All litteratur är på engelska.

Förkunskaper

Algebra och Sannolikhetsteori. TSIT02 Datasäkerhet eller TSIT01 Datasäkerhetsmetoder samt Diskret matematik rekommenderas.

Ansvariga personer

Jan-Åke Larsson B-huset, ing 27-29, 1 tr, A-korr, 472 jan-ake.larsson@liu.se Föreläsningar, examination
Jonathan Jogenfors B-huset, ing 27-29, 1 tr, A-korr, 476 jonathan.jogenfors@liu.se Labbar
Niklas Johansson B building, ing 27-29, 1st floor, A-corr, 476 niklas.johansson@liu.se Pubkey Labbar

Kurslitteratur

Kursbok: "Introduction to Cryptography with Coding Theory" av Wade Trappe och Lawrence Washington.

Course plan
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 Elliptic Curve Cryptography, key distribution and trust Ch 16.1, 16.5, and 10
Lecture 10 Quantum cryptography Ch 19.1-2, + more
Lab 4 Quantum Cryptography Lab-PM 4
Guest Lecture Sectra Communications. See information below.
Lecture 11 Zero knowledge and Secret sharing. Lecture cancelled! Ch 7.3, 12, 14
Lecture 12 Bitcoin, Blockchain Not Ch 11

Guest lecture: Sectra Communications

Date: 5th of October at 10-12
Location: Ada Lovelace
Robin von Post is the CTO of Sectra Communications, a European provider of secure mobile communication solutions to government, defence and other critical functions of society throughout NATO and EU.

With a background from Linköping University, Robin joined Sectra in 1997 and spent his first six years in various technical leadership roles within the mobile wireless division. Since 2003 he has held various roles within the security business, including project and product management, business development, bid management and sales.

He has continuously worked in close contact with the network of national security entities and has gathered thorough knowledge in interpreting and understanding requirements within the security domain. With almost 20 years of professional experience in the field of mobility and security, Robin has a solid foundation for overlooking and analyzing trends and development in an increasingly changing domain.

Laborationer

När kursen börjar kan du anmäla dig till de fyra obligatoriska laborationerna i lisam. Notera att studenterna ska ha förberett sig noga för att kunna slutföra labbarna på avsatt tid. Laborationerna utförs i par om två studenter.

Examination

En skriftlig tentamen, dessa tentamenstillfällen finns. Tidigare tentamina med lösningar: 2015-10-28,

En (engelsk) detaljbeskrivning av kraven:

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.

Especially:

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.

Informationsansvarig: Jan-Åke Larsson
Senast uppdaterad: 2017-10-09