Filter by content type

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

Remove all filters

633 results

    • Seminar

    • Cryptography

    Finding ECM-Friendly Curves through a Study of Galois Properties

    • January 29, 2016

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

    Speaker : Cyril Bouvier - Institut de mathématiques de Bordeaux

    In this talk, I'll prove some divisibility properties of the cardinality of elliptic curve groups modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic curve method (ECM) for integer factorization. The ideas behind the proofs can be used to find new infinite families of elliptic curves with good division[…]

    • Seminar

    • Cryptography

    Soutenance de thèse

    • October 07, 2016

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

    Speaker : Brice Minaud - Université Rennes 1

    TBD

    • Seminar

    • Cryptography

    tbd

    • September 18, 2015

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

    Speaker : Hugues Randriam - Telecom Paristech

    tbd

    • Seminar

    • Cryptography

    Construction d'une petite boite S 8-bit avec branchement 3 (&applications)

    • April 29, 2016

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

    Speaker : Pierre Karpman - Rennes 1 et Singapour

    Je présenterai la construction et l'implémentation d'une boîte S sur 8 bits qui a un branchement linéaire et différentiel de 3. Je montrerai une application en construisant un chiffre par bloc sur 64 bits dont la structure est très simple et basée sur l'évaluation en tranches (bitsliced) et des rotations sur mots de 8 bits. La fonction de tour de ce chiffre peut s'implémenter avec le même nombre d[…]

    • Seminar

    • Cryptography

    Computing individual discrete logarithms in non-prime finite fields

    • November 13, 2015

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

    Speaker : Aurore Guillevic - Inria Saclay, équipe Grace et Ecole Polytechnique, LIX

    This talk is about computing discrete logarithms in non-prime finite fields. These fields arise in pairing-based cryptography. In this setting, the pairing-friendly curve is defined over GF(q) and the pairing takes its values in an extension GF(q^k), where k is the embedding degree.<br/> Fr example, GF(p^2) is the embedding field of supersingular elliptic curves in large characteristic; GF(p^3),[…]

    • Seminar

    • Cryptography

    Speeding up Fully Homomorphic Encryption

    • June 10, 2016

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

    Speaker : Marie Paindavoine - Orange Labs

    Access to encrypted data is often “all-or-nothing” : either one has to decrypt everything, or one cannot read anything. Following Gentry’s work in 2009, fully homomorphic encryption has gained more and more attention, in particular because it allows more flexibility on encrypted data access and process. It is now possible to evaluate functions on encrypted data and get only the result – encrypted[…]
Page top