Information, Théorie de l'

Vidéos

2.2. Security-Reduction Proof
Vidéo pédagogique
00:04:42

2.2. Security-Reduction Proof

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

Welcome to the second session. We will talk about the security-reduction proof. The security of a given cryptographic algorithm is reduced to the security of a known hard problem. To prove that a

2.3. McEliece Assumptions
Vidéo pédagogique
00:03:14

2.3. McEliece Assumptions

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will talk about McEliece assumptions. The security of the McEliece scheme is based on two assumptions as we have already seen: the hardness of decoding a random linear code and

2.4. Notions of Security
Vidéo pédagogique
00:05:31

2.4. Notions of Security

Marquez-Corbella
Irene
Sendrier
Nicolas
Finiasz
Matthieu

In this session, we will study the notion of security of public-key scheme. A public-key scheme is one-way if the probability of success of any adversary running in polynomial time is negligible.

Voir plus