Je recherche

656 résultats

• • 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

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

• • 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-anonymity)[…]

• • Séminaire

  • Cryptographie

  Cryptography, Encryption, and Big Data

  • 06 novembre 2015

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

  Orateur : Hoeteck Wee - ENS

  We live in an era of "Big Data", wherein a deluge of data is being generated, collected, and stored all around us. In order to protect this data, we need to encrypt it. This raises a fundamentally new challenge in cryptography: Can we encrypt data while enabling fine-grained access control and selective computation, as is necessary to protect big, complex data? In this talk, I will present my work[…]

• • Séminaire

  • Cryptographie

  The SKINNY Family of Block Ciphers

  • 03 juin 2016

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

  Orateur : Jérémy Jean - ANSSI

  We present a new tweakable block cipher family SKINNY, whose goal is to compete with NSA recent design SIMON in terms of hardware/software performances, while proving in addition stronger security guarantees with regards to differential/linear attacks.<br/> SKINNY has flexible block/key/tweak sizes and can also benefit from very efficient threshold implementations for side-channels protection.[…]