Coursebooks

Cryptography and security

Vaudenay Serge

English

Summary

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented.

Content

1. Ancient cryptography: Vigenère, Enigma, Vernam cipher, Shannon theory
2. Diffie-Hellman cryptography: algebra, Diffie-Hellman, ElGamal
3. RSA cryptography: number theory, RSA, factoring
4. Elliptic curve cryptography: elliptic curves over a finite field, ECDH, ECIES
5. Symmetric encryption: block ciphers, stream ciphers, exhaustive search
6. Integrity and authentication: hashing, MAC, birthday paradox
7. Applications to symmetric cryptography: mobile telephony, Bluetooth, WiFi
8. Public-key cryptography: cryptosystem, digital signature
9. Trust establishment: secure communication, trust setups
10. Case studies: Bluetooth, TLS, SSH, PGP, biometric passport

Keywords

cryptography, encryption, secure communication

Learning Prerequisites

Required courses

• Algebra (MATH-310)
• Probability and statistics (MATH-310)
• Algorithms (CS-250)

Recommended courses

• Network security (COM-301)

Important concepts to start the course

• Mathematical reasoning
• Probabilities
• Algebra, arithmetics
• Algorithmics

Learning Outcomes

By the end of the course, the student must be able to:
• Choose the appropriate cryptographic primitive in a security infrastructure
• Judge the strength of existing standards
• Assess / Evaluate the security based on key length
• Implement algorithms manipulating big numbers and use number theory
• Use algebra and probability theory to analyze cryptographic algorithms
• Identify the techniques to secure the communication and establish trust

ex-cathedra

Expected student activities

• active participation during the course
• take notes during the course
• do the exercises during the exercise sessions
• complete the regular tests and homework
• read the material from the course
• self-train using the provided material
• do the midterm exam and final exam

Assessment methods

Mandatory continuous evaluation:

• homework (30%)
• midterm exam (40%)

Final exam averaged (same weight) with the contiuous evaluation, but with final grade between final_exam-1 and final_exam+1.

Supervision

 Office hours No Assistants Yes Forum No Others Lecturers and assistants are available upon appointment.

Resources

Bibliography

• Communication security: an introduction to cryptography. Serge Vaudenay. Springer 2004.
• A computational introduction to number theory and algebra. Victor Shoup. Cambridge University Press 2005.

Prerequisite for

• Algorithms in public-key cryptography (COM-408)

Reference week

MoTuWeThFr
8-9
9-10
10-11
11-12
12-13
13-14
14-15
15-16
16-17
17-18
18-19
19-20
20-21
21-22
Under construction

Lecture
Exercise, TP
Project, other

legend

• Autumn semester
• Winter sessions
• Spring semester
• Summer sessions
• Lecture in French
• Lecture in English
• Lecture in German