156 ressources en auto-formation par thème : Analyse numérique appliquée, calcul numérique, mathématiques numériques

FILTRES

156 résultats
page 16 sur 16
Résultats de 151 à 156
Présentation de la ressource en auto-formation 2.2. Security-Reduction Proof cours / présentation
2.2. Security-Reduction Proof
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 cryptosystem is secure, we select a problem which we know is hard to solve, and we reduce the problem ...
Présentation de la ressource en auto-formation 5.5. Stern’s Zero-Knowledge Identification Scheme cours / présentation
5.5. Stern’s Zero-Knowledge Identification Scheme
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 his identity to a verifier. And the Zero-Knowledge Protocol is an interactive protocol where one pro ...
Présentation de la ressource en auto-formation 3.6. Stern/Dumer Algorithm cours / présentation
3.6. Stern/Dumer Algorithm
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : In this session, we will present the Stern algorithm for decoding. In fact, the idea is to combine two algorithms that we have seen before, the Lee and Brickell algorithm and the Birthday Decoding.  So, instead of a full Gaussian elimination, we will simply have a partial Gaussian elimination as ...
Présentation de la ressource en auto-formation 4.2. Support Splitting Algorithm cours / présentation
4.2. Support Splitting Algorithm
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : This session will be about the support splitting algorithm. For the q-ary case, there are three different notions of equivalence. The general one: two codes of length n are semi-linear equivalent if they are equal up to a fixed linear map. Each linear map is the composition of a permutation, a scalar ...
Présentation de la ressource en auto-formation 5.2. The Courtois-Finiasz-Sendrier (CFS) Construction cours / présentation
5.2. The Courtois-Finiasz-Sendrier (CFS) Construction
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : In this session, I am going to present the Courtois-Finiasz-Sendrier Construction of a code-based digital signature. In the previous session, we have seen that it is impossible to hash a document into decodable syndromes. But it is possible to hash onto the space of all syndromes. The document is ...
Présentation de la ressource en auto-formation 5.7. The Fast Syndrome-Based (FSB) Hash Function cours / présentation
5.7. The Fast Syndrome-Based (FSB) Hash Function
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
Description : 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 cryptographic hash function? So, it is a function which takes an input of arbitrary size and outputs a fixed si ...