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

762 résultats

    • Séminaire

    • SemSecuElec

    libecc: a flexible open-source ECC library for embedded devices

    • 14 février 2020

    • ANSSI - Salle Pétri/Turing

    Orateur : Ryad Benadjila et Arnaud Ebalard

    libecc is a software library for elliptic curves based cryptography (ECC), with an API supporting signature algorithms specified in the ISO14888-3 standard.Advanced usages of this library also include the possible implementation of elliptic curve based Diffie-Hellman protocols as well as any algorithm on top of prime fields based elliptic curves (or prime fields, or rings of integers).The[…]

    • Séminaire

    • SemSecuElec

    Une approche pour l’accélération matérielle pour le chiffrement homomorphe

    • 14 décembre 2018

    • CEA List

    Orateur : Joël Cathebras

    Le chiffrement homomorphe est un outil cryptographique permettant la manipulation de données en aveugle. Son utilisation généralisée permettrait de proposer des solutions de calcul déporté impliquant des données confidentielles, par exemple des données génomiques pour la médecine personnalisée. Cependant, le chiffrement homomorphe doit faire face à de grandes complexités mémoires et calculatoires.[…]

    • Séminaire

    • SemSecuElec

    Code-based postquantum cryptography : candidates to standardization

    • 23 avril 2021

    • INRIA - Web-Conférence

    Orateur : Nicolas Sendrier

    At the third round of the NIST standardization process, three candidates remain with a security based on error correcting codes, all are key exchange mechanisms. We will explore them according to their security assumptions and properties. Among them, we find an historical scheme (Classic McEliece), as well as schemes using sparse and quasi-cyclic matrices (BIKE and HQC). We will examine pros and[…]

    • Séminaire

    • Cryptographie

    On Rejection Sampling in Lyubashevsky's Signature Scheme

    • 06 mai 2022

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

    Orateur : Julien Devevey - ENS de Lyon

    Lyubashevsky’s signatures are based on the Fiat-Shamir with aborts paradigm, whose central ingredient is the use of rejection sampling to transform (secret-key-dependent) signature samples into samples from a secret-key-independent distribution. The choice of these two underly- ing distributions is part of the rejection sampling strategy, and various instantiations have been considered up to this[…]

    • Séminaire

    • Cryptographie

    Syndrome Decoding in the Head – Shorter Signatures from Zero-Knowledge proofs

    • 10 juin 2022

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

    Orateur : Thibauld Feneuil - CryptoExperts et Sorbonne Université

    In this talk, I will present a new zero-knowledge proof of knowledge for the syndrome decoding (SD) problem on random linear codes. Instead of using permutations like most of the existing protocols, we rely on the MPC-in-the-head paradigm in which we reduce the task of proving the low Hamming weight of the SD solution to proving some relations between specific polynomials. Specifically, we propose[…]

    • Séminaire

    • Cryptographie

    Elliptic curves for SNARKs

    • 01 septembre 2022

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

    Orateur : Youssef El Housni - LIX

    At CANS’20, El Housni and Guillevic introduced a new 2-chain of pairing-friendly elliptic curves for recursive zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) made of the former BLS12-377 curve (a Barreto–Lynn–Scott curve over a 377- bit prime field) and the new BW6-761 curve (a Brezing–Weng curve of embedding degree 6 over a 761-bit prime field). First we generalise the[…]
Haut de page