# Coursebooks

Vaudenay Serge

English

#### Summary

This course reviews some failure cases in public-key cryptography. It introduces some cryptanalysis techniques. It also presents fundamentals in cryptography such as interactive proofs. Finally, it presents some techniques to validate the security of cryptographic primitives.

#### Content

1. Public-key cryptography: Factoring, RSA problem, discrete logarithm problem, attacks based on subgroups

2. Conventional cryptography: differential and linear cryptanalysis, hypothesis testing, decorrelation

3. Interactive proofs: NP-completeness, interactive systems, zero-knowledge

4. Proofs techniques: Security of encryption, random oracles, game reduction techniques

#### Keywords

cryptography, cryptanalysis, interactive proof, security proof

#### Learning Prerequisites

##### Required courses

• Cryptography and security (COM-401)

##### Important concepts to start the course

• Cryptography
• Mathematical reasoning
• Number theory and probability theory
• Algorithmics
• Complexity

#### Learning Outcomes

By the end of the course, the student must be able to:
• Assess / Evaluate the security deployed by cryptographic schemes
• Prove or disprove security
• Justify the elements of cryptographic schemes
• Analyze cryptographic schemes
• Implement attack methods
• Model security notions

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.
• Algorithmic cryptanalysis. Antoine Joux. CRC 2009.

### 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