Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 5388
Label UNT Vidéocours

le (7m28s)

3.7. May, Meurer, and Thomae Algorithm

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 by Howgrave-Graham and Joux in 2010 in which we will relax the way we construct the two lists in Birthday Decoding. So, if you remember, we could relax the size of the matrices H1 and H2 slightly to gain a polynomial factor on Birthday Decoding. But, we may push the idea further and increase the size of H1 and ...
Voir la vidéo

 
FMSH
 
Facebook Twitter
Mon Compte