M Bernard Falck, Directeur de l'éducation et de la formation, MEDEF
M Bernard Falck, Directeur de l'éducation et de la formation, MEDEF
Mon compte
Pas encore inscrit ?
M Bernard Falck, Directeur de l'éducation et de la formation, MEDEF
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
MARQUEZ-CORBELLA Irene
SENDRIER Nicolas
FINIASZ Matthieu
The session nine is devoted to the application of the Generalized Birthday Algorithm to decoding. The Generalized Birthday Algorithm was presented by David Wagner in 2002, in a more general
MARQUEZ-CORBELLA Irene
SENDRIER Nicolas
FINIASZ Matthieu
In this session, we are going to see how to build an efficient provably secure one-way function from coding theory. As you know, a one-way function is a function which is simple to evaluate and
BRONNER Gérald
Conférence de l'Institut d'Astrophysique de Paris présentée par Gérald Bronner, professeur de Sociologie Université Paris-Diderot (Paris 7) le 1er avril 2014. Pourquoi les mythes du complot
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
MARQUEZ-CORBELLA Irene
SENDRIER Nicolas
FINIASZ Matthieu
The final session of this week is devoted to Decoding One Out of Many. Decoding One Out of Many is interested in solving the following variant of Syndrome Decoding. In this variant, the only
MARQUEZ-CORBELLA Irene
SENDRIER Nicolas
FINIASZ Matthieu
In the last session of this week, we will have a look at the FSB Hash Function which is built using the one-way function we saw in the previous session. What are the requirements for a
BRONNER Gérald
Conférence de l'Institut d'Astrophysique de Paris présentée par Gérald Bronner, professeur de Sociologie Université Paris-Diderot (Paris 7) le 1er avril 2014. Pourquoi les mythes du complot
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.
MARQUEZ-CORBELLA Irene
SENDRIER Nicolas
FINIASZ Matthieu
Welcome to the fourth week of the MOOC Code-based Cryptography. Recall that we have mainly two ways of cryptanalyzing in the McEliece cryptosystem. We have Message Attacks, which address the problem
MOEGLIN Pierre
Pierre Mœglin Pierre Mœglin est à l’origine, en 1991, avec Élisabeth Fichez, du Sif, qu’il anime depuis cette date. Ses recherches portent en parallèle sur les industries éducatives et l