Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
679 résultats
-
-
Séminaire
-
Cryptographie
On the related-key attacks against AES
Orateur : Vincent Rijmen - University of Graz
In a recent series of papers, Alex Biryukov, Dmitry Khovratovich (et al.) presented a number of related-key attacks on AES and reduced-round versions of AES. The most impressive of these were presented at Asiacrypt 2009: related-key attacks against the full AES-256 and AES-192. The publication of these attacks has led some people to question the security of AES.<br/> While we agree that the[…] -
-
-
Séminaire
-
Cryptographie
An Algebraic Decoding of Negacyclic Codes Over the Integers Modulo 4
Orateur : Eimar Byrne - University College Dublin
In the 1960s, Berlekamp introduced the negacyclic codes over GF(p) and described an efficient decoder that corrects any t Lee errors, where p > 2t. We consider this family of codes, defined over the integers modulo 4. We show that if a generator polynomial for a Z4 negacyclic code C has roots a^{2j+1} for j=0,...,t, where a is a primitive 2n th root of unity in a Galois extension of Z4, then C is[…] -
-
-
Séminaire
-
Cryptographie
Indifférentiabilité et preuves de sécurité dans des modèles idéalisés
Orateur : Yannick Seurin - France Telecom
Les preuves de sécurité en cryptographie font très souvent appel à des modèles idéalisés consistant à remplacer un certain composant d'un cryptosystème par la primitive idéale correspondante (par exemple une fonction de hachage modélisée par un oracle aléatoire). Dans cet exposé nous présenterons le concept d'indifférentiabilité introduit par Maurer, Renner et Holenstein et son application aux[…] -
-
-
Séminaire
-
Cryptographie
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
Orateur : Christian Wieschebrink - BSI
In this talk a structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized Reed-Solomon (GRS) codes is presented. It allows the reconstruction of the private key for almost all practical parameter choices in polynomial time with high probability. The main step of the attack consists in constructing a related full GRS code from the subcode by[…] -
-
-
Séminaire
-
Cryptographie
Lifting techniques for polynomial system solving.
Orateur : Eric Schost - University of Western Ontario
Through examples taken from point-counting problems or invariant theory, I will give an overview of how lifting techniques (that is, symbolic versions of Newton's iteration) can help us solve polynomial systems.<br/> I will review the key ingredients needed to put this kind of approach to practice, such as degree bounds or efficient arithmetic for polynomials and power series, and hint at the[…] -
-
-
Séminaire
-
Cryptographie
How to break Remote Keyless Entry Systems.
Orateur : Timo Kasper - Bochum
KeeLoq remote keyless entry systems are widely used for access control purposes such as garage openers or car door systems. The talk will present the first successful differential power analysis attacks on numerous commercially available products employing KeeLoq code hopping. They allow for efficiently revealing both the secret key of a remote transmitter and the manufacturer key stored in a[…] -