Théorie algorithmique de l'information
Qu'est-ce que l'information et comment la mesurer ? qu'est-ce que la complexité et comment la mesurer ? En 2013, les travaux d'application sur la mesure de la complexité continuent car on est encore
Mon compte
Pas encore inscrit ?
Qu'est-ce que l'information et comment la mesurer ? qu'est-ce que la complexité et comment la mesurer ? En 2013, les travaux d'application sur la mesure de la complexité continuent car on est encore
This is the last session of the first week of this MOOC. We have already all the ingredients to talk about code-based cryptography. Recall that in 1976 Diffie and Hellman published their famous
So, with the session 7 we are entering the most advanced part of that course. The idea of what I called the Improved Birthday Decoding is to use the so-called "representation technique" introduced
In this session, I will present a variant of the CFS signature scheme called parallel-CFS. We start from a simple question: what happens if you try to use two different hash functions and compute
Mme Charlotte Duda, ex-présidente de l'ANDRH
Welcome to the second week of this MOOC entitled Code-Based Cryptography. This week, we will talk in detail about the McEliece cryptosystem. First, in this session, we will describe formally the
Now in session 8, we will present yet another evolution of information set decoding. Before presenting this improvement, we will first improve the Birthday Decoding algorithm what I call a Further
In this session, we are going to have a look at Stern’s Zero-Knowledge Identification Scheme. So, what is a Zero-Knowledge Identification Scheme? An identification scheme allows a prover to prove
M Bernard Falck, Directeur de l'éducation et de la formation, MEDEF
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
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
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