Je recherche

634 résultats

• • Séminaire

  • Cryptographie

  Computing individual discrete logarithms in non-prime finite fields

  • 13 novembre 2015

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

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

• • Séminaire

  • Cryptographie

  Speeding up Fully Homomorphic Encryption

  • 10 juin 2016

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

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

• • Séminaire

  • Cryptographie

  Symmetric Encryption Scheme adapted to Fully Homomorphic Encryption Scheme

  • 30 septembre 2016

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

  Orateur : Pierrick Méaux - ENS Paris

  Fully Homomorphic Encryption is a powerful cryptographic construction, enabling to securely compute all functions on encrypted data, and decrypt the result of the function applied on the real data.<br/> This construction allows to securely delegate computation, which is a very important property with the increasing of the Cloud computing. Many client-server applications are appearing, all[…]

• • Séminaire

  • Cryptographie

  Algorithms for polynomial selection in the number field sieve

  • 18 décembre 2015

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

  Orateur : Shi Bai - Australian National University

  The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The running-time of the number field sieve depends on the quality of the chosen polynomials. The quality of the chosen polynomials can be modeled in terms of size and root properties. In this talk, we will describe some[…]

• • Séminaire

  • Cryptographie

  Soutenance de thèse

  • 03 juillet 2015

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

  Orateur : Tristan Vaccon - IRMAR

• • Séminaire

  • Cryptographie

  Fonction de hachage et protection de la vie privée

  • 22 avril 2016

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

  Orateur : Cédric Lauradoux - INRIA

  Les fonctions de hachage à sens unique sont très utilisées pour générer des pseudonymes et anonymiser des données. Le résultat obtenu est rarement à la hauteur des espoirs mis dans le hachage. Dans de nombreux cas, on a pu ré-identifier des bases de données anonymiser avec des fonctions de hachage. Dans cet exposé, nous reviendrons sur les garanties d'anonymat (anonymity-set-size ou k[…]