Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
655 results
-
-
Seminar
-
Cryptography
Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds
Speaker : Orr Dunkelman - ENS
AES is the best known and most widely used block cipher. Its three versions (AES-128, AES-192, and AES-256) differ in their key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively). In the case of AES-128, there is no known attack which is faster than the 2^{128} complexity of exhaustive search. However, AES-192 and AES-256 were recently shown to be[…] -
-
-
Seminar
-
Cryptography
Hardware Operators for Pairing-Based Cryptography
Speaker : Jean-Luc Beuchat - University of Tsukuba
This talk is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing. We propose here a novel hardware implementation of Miller's loop based on a pipelined Karatsuba-Ofman multiplier. Thanks to a careful choice of the mean of computing the Tate pairing and algorithms for tower field arithmetic, we manage to keep the pipeline busy. We also describe the strategies we[…] -
-
-
Seminar
-
Cryptography
Algebraic Analysis of MinRank
Speaker : Françoise Levy-dit-Vehel - ENSTA
We here investigate the hardness of one of the most relevant problems in multivariate cryptography, namely MinRank: given non-negative intgers n,k,r, and matrices M_0,...,M_k, of size n with entries in F_q, decide whether there exists an F_q-linear combination of those matrices which has rank less than or equal to r. Our starting point is the Kipnis-Shamir modeling of the problem. We first prove[…] -
-
-
Seminar
-
Cryptography
Opérateurs matériels pour la cryptographie basée sur les
Speaker : Jérémie Detrey - LORIA
Introduits initialement dans le domaine de la cryptographie par Menezes, Okamoto & Vanstone (1993) puis Frey & Rück (1994) pour attaquer le problème du logarithme discret sur certaines courbes elliptiques, les couplages sont depuis quelques années à la base de nombreux protocoles utiles en cryptographie tels que la signature numérique courte ou la cryptographie basée sur l'identité. L'évaluation[…] -
-
-
Seminar
-
Cryptography
Computing isogenies of small degrees on Abelian Varieties
Speaker : Damien Robert - LORIA
Isogenies are an essential tool in Elliptic Curves cryptography, where they are used in a wide variety of area: fast point counting, complex multiplication methods... Velu's formulas give an efficient method for computing such isogenies, but there are no formula known for curves of higher genera or general abelian varieties (except some special case for isogenies of degree 2). In this talk we will[…] -
-
-
Seminar
-
Cryptography
Isogenies and Discrete Logarithms in Jacobians of genus 3 curves
Speaker : Ben Smith - Ecole Polytechnique
Until recently, the best known algorithm for solving a Discrete Logarithm Problem (DLP) in the Jacobian of a hyperelliptic genus 3 curve ran in time \softO(q^(4/3)), while the best known algorithm for non-hyperelliptic genus 3 curves ran in time \softO(q). In this talk, we describe an efficient algorithm for moving instances of the DLP from a hyperelliptic genus 3 Jacobian to a non-hyperelliptic[…] -