Filtrer par type de contenu

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

699 résultats

    • Séminaire

    • Cryptographie

    Unifying Leakage Models on a Renyi Day

    • 20 septembre 2019

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

    Orateur : Thomas Prest - PqShield

    In the last decade, several works have focused on finding the best way to model circuit leakage in order to obtain provably secure implementations. One of the most realistic models is the noisy leakage model, introduced in (Prouff, Rivain'13) and (Duc-Dziembowski-Faust'14) together with secure constructions. These works suffer from various limitations, in particular the use of ideal leak-free[…]
    • Séminaire

    • Cryptographie

    Learning With Errors and Extrapolated Dihedral Cosets Problem

    • 23 février 2018

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

    Orateur : Weiqiang Wen - ENS de Lyon

    The hardness of the learning with errors (LWE) problem is one of the most fruitful resources of modern cryptography. In particular, it is one of the most prominent candidates for secure post-quantum cryptography. Understanding its quantum complexity is therefore an important goal. We show that under quantum polynomial time reductions, LWE is equivalent to a relaxed version of the dihedral coset[…]
    • Séminaire

    • Cryptographie

    Number Systems and Cryptography, some examples

    • 08 février 2019

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

    Orateur : Jean-Claude Bajard - Sorbonne Université

    Number systems are behind a lot of implementations. The role of representation is often underrated while its importance in implementation is crucial. We survey here some classes of fundamental systems that could be used in crypotgraphy. We present three main categories:<br/> - systems based on the Chinese Remainder Theorem which enter more generally in the context of polynomial interpolation,<br/[…]
    • Séminaire

    • Cryptographie

    Optimisation des Principaux Composants des Chiffrements par Bloc

    • 22 octobre 2019

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

    Orateur : Baptiste Lambin - soutenance de thèse salle Métivier à l'IRISA, 14h

    La sécurité des chiffrements par bloc évolue constamment au fur et à mesure que de nouvelles techniques de cryptanalyse sont découvertes. Lors de la conception de nouveaux chiffrements par bloc, il est donc nécessaire de considérer ces nouvelles techniques dans l'analyse de sécurité. Dans cette thèse, nous montrons comment construire certaines opérations internes des chiffrements par bloc pour[…]
    • Séminaire

    • Cryptographie

    Coercion-resistant Internet voting made practical

    • 03 mars 2017

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

    Orateur : Jacques Traore - Orange Labs

    Internet voting offers a better voting experience since voters can cast their votes from their computers or even smartphones. By eliminating the need to visit polling places, it may attract more voters and thus increase voter turnout. However, it is still not widely spread owing to many inherent concerns such as risks entailed by the lack of private polling booths. Indeed, this may ease coercion[…]
    • Séminaire

    • Cryptographie

    Lilliput: Advances in Security and Performance Analysis

    • 17 novembre 2017

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

    Orateur : Julien Francq - Airbus CyberSecurity

    Lilliput is a block cipher that has been published in 2015 in IEEE Transactions in Computers with Thierry Berger and Marine Minier, and the seminal paper has been cited 6 times for now. This talk will summarize the results of the third-party cryptanalysis and implementations, and will show that Lilliput is still an efficient and secure cryptographic primitives.