Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

657 results

    • Seminar

    • Cryptography

    Hardware Operators for Pairing-Based Cryptography

    • March 13, 2009

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    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

    • November 27, 2009

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    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

    • November 14, 2008

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    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

    • April 17, 2009

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    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

    • January 09, 2009

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    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[…]

    • Seminar

    • Cryptography

    Une variante elliptique du test de primalité AKS

    • June 26, 2009

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Reynald Lercier - CELAR/IRMAR

    Nous présenterons dans cet exposé le test AKS et ses améliorations, qui permettent de prouver qu'un entier N est un nombre premier. Nous verrons comment il nous a été récemment possible d'obtenir une variante de ces tests plus efficace, en généralisant aux courbes elliptiques, des idées de Berrizbeitia - Cheng - Avanzi - Mihailescu - Bernstein. En particulier, il nous est possible de nous[…]
Page top