Filter by content type

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

Remove all filters

718 results

    • Seminar

    • Cryptography

    Tightly Secure CCA-Secure Encryption without Pairings.

    • November 25, 2016

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

    Speaker : Romain Gay - ENS

    (Joint work with Dennis Hofheinz, Eike Kiltz and Hoeteck Wee) We present the first CCA-secure public-key encryption scheme based on DDH where the security loss is independent of the number of challenge ciphertexts and the number of decryption queries. Our construction extends also to the standard k-Lin assumption in pairing-free groups, whereas all prior constructions starting with Hofheinz and[…]
    • Seminar

    • Cryptography

    Où en est-on avec le calcul quantique?

    • May 19, 2017

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

    Speaker : Dimitri Petritis - IRMAR

    Le calculateur universel quantique n'a toujours pas dépassé le stade de prototype de démonstration et reste insuffisant pour faire tourner l'algorithme de factorisation de Shor sur des instances réalistes. Cependant, des avancées algorithmiques ont été faites sur des machines quantiques dédiées qui permettent d'aborder certains problèmes difficiles (au sens de la complexité); ces nouvelles[…]
    • Seminar

    • Cryptography

    On the Construction of Lightweight S-Boxes

    • December 15, 2017

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

    Speaker : Sébastien Duval - INRIA Paris-Rocquencourt

    S-Boxes are essential objects in the conception of blockciphers. Typically, an S-Box is simply a permutation (bijective function) on n bits, with n small (usually 4 or 8). Its role in a blockcipher is to bring nonlinearity to the cipher, thus an S-Box must be highly nonlinear. Several parameters of a function are used to measure nonlinearity, among which the most important are differential[…]
    • Seminar

    • Cryptography

    Cryptography, Encryption, and Big Data

    • November 06, 2015

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

    Speaker : 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[…]
    • Seminar

    • Cryptography

    The SKINNY Family of Block Ciphers

    • June 03, 2016

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

    Speaker : 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.[…]
    • Seminar

    • Cryptography

    Certification de représentations galoisiennes modulaires

    • December 11, 2015

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

    Speaker : Nicolas Mascot - Université de Bordeaux 1

    Nous verrons comment certifier algorithmiquement des calculs de représentations galoisiennes associés à des formes modulaires, en nous appuyant notamment sur le théorème de Khare-Wintenberger (ex conjecture de modularité de Serre) et des calculs de cohomologie des groupes afin de déterminer le groupe de Galois de certains polynômes.