Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
679 results
-
-
Seminar
-
Cryptography
Deterministic equation solving over finite fields
Speaker : Christiaan van de Woestijne - Montanuniversität Leoben
It is a curious fact that most efficient algorithms for solving algebraic equations over finite fields are probabilistic. In this talk, I will give an overview over deterministic techniques that are applicable. The case of constructing rational points on elliptic curves is especially relevant for cryptographic applications. I will give a detailed exposition of my algorithm for this purpose and[…] -
-
-
Seminar
-
Cryptography
On the related-key attacks against AES
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
An Algebraic Decoding of Negacyclic Codes Over the Integers Modulo 4
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Indifférentiabilité et preuves de sécurité dans des modèles idéalisés
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
La fin des attaques DPA ? Masquage et Désynchronisation : La combinaison gagnante
Speaker : Julien Doget - Oberthur
L'analyse différentielle de la consommation (DPA) est une puissante attaque, permettant de récupérer une clé cryptographique, utilisée dans les systèmes embarqués. Cette attaque est particulièrement efficace sur les algorithmes de chiffrements par blocs. Pour une implémentation logicielle, deux techniques principales sont généralement appliquées pour la contrecarrer : le masquage et la[…] -