Coursebooks 2016-2017

PDF
 

Advanced cryptography

COM-501

Lecturer(s) :

Vaudenay Serge

Language:

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

Important concepts to start the course

Learning Outcomes

By the end of the course, the student must be able to:

Teaching methods

ex-cathedra

Expected student activities

Assessment methods

Mandatory continuous evaluation:

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

Ressources en bibliothèque
Websites

In the programs

Reference week

 MoTuWeThFr
8-9 BC03   
9-10    
10-11 BC03   
11-12    
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Lecture
      Exercise, TP
      Project, other

legend

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