Label UNT Conférences
le (1h17s)
Résultats de recherche
Trier par :
Nombre de programmes trouvés : 226
Label UNT Vidéocours
le (5m28s)
4.6. Attack against GRS codes
...In this session we will discuss the proposal of using generalized Reed-Solomon codes for the McEliece cryptosystem. As we have already said, generalized Reed-Solomon codes were proposed in 1986 by Niederreiter. Recall that these codes are MDS,... Voir la vidéo
Label UNT Vidéocours
le (5m48s)
4.7. Attack against Reed-Muller codes
...In this session, we will introduce an attack against binary Reed-Muller codes. Reed-Muller codes were introduced by Muller in 1954 and, later, Reed provided the first efficient decoding algorithm for these codes. Reed-Muller are just a... Voir la vidéo
Label UNT Vidéocours
le (5m40s)
1.8. Goppa Codes
...In this session, we will talk about another family of codes that have an efficient decoding algorithm: the Goppa codes. One limitation of the generalized Reed-Solomon codes is the fact that the length is bounded by the size of the field over... Voir la vidéo
Label UNT Vidéocours
le (6m46s)
4.8. Attack against Algebraic Geometry codes
...In this session, we will present an attack against Algebraic Geometry codes (AG codes). Algebraic Geometry codes is determined by a triple. First of all, an algebraic curve of genus g, then a n-tuple of rational points and then a divisor which... Voir la vidéo
Label UNT Vidéocours
le (4m4s)
4.9. Goppa codes still resist
...All the results that we have seen this week doesn't mean that code based cryptography is broken. So in this session we will see that Goppa code still resists to all these attacks. So recall that it is assumed that Goppa codes are pseudorandom,... Voir la vidéo
Label UNT Vidéocours
le (3m57s)
4.4. Attack against subcodes of GRS codes
...In this session, we will talk about using subcodes of a Generalized Reed–Solomon code for the McEliece Cryptosystem. Recall that to avoid the attack of Sidelnikov and Shestakov, Berger and Loidreau proposed to replace Generalized Reed–Solomon... Voir la vidéo
Label UNT Vidéocours
le (6m21s)
4.2. Support Splitting Algorithm
...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... Voir la vidéo
Label UNT Vidéocours
le (5m19s)
4.3. Distinguisher for GRS codes
...In this session we will see that generalized Reed-Solomon codes behave differently than random codes with respect to the star operation. Thus we can define a distinguisher for Generalized Reed-Solomon codes. Let us recall the definition of... Voir la vidéo
Label UNT Vidéocours
le (5m32s)
