Filter by content type

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

Remove all filters

744 results

    • Seminar

    • Cryptography

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

    • June 10, 2022

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

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

    • Seminar

    • Cryptography

    Elliptic curves for SNARKs

    • September 01, 2022

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

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

    • Seminar

    • Cryptography

    Improved Classical and Quantum Algorithms for Subset-Sum

    • March 06, 2020

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

    Speaker : André Schrottenloher - INRIA

    We present new classical and quantum algorithms for solving random hard instances of the subset-sum problem, in which we are given n integers on n bits and try to find a subset of them that sums to a given target. This classical NP-complete problem has several applications in cryptography and underlies the security of some proposed post-quantum cryptosystems.<br/> At EUROCRYPT 2010, Howgrave[…]

    • Seminar

    • Cryptography

    Workshop mise en oeuvre de la cryptographie post-quantique

    • November 17, 2021

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

    Speaker : European CyberWeek - Rennes

    L'inscription est gratuite mais obligatoire, en particulier pour des raisons de jauges. Le nombre de places est limité. Le programme est disponible à l'adresse <a href="https://www.european-cyber-week.eu/cryptographie-post-quantique">https://www.european-cyber-week.eu/cryptographie-post-quantique</a><br/&gt;

    • Seminar

    • Cryptography

    Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

    • April 10, 2020

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

    Speaker : Emmanuel Thomé - INRIA Nancy

    We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not[…]

    • Seminar

    • Cryptography

    Soutenance de thèse: Autour de la sécurité des messageries instantanées: des solutions pour des applications multi-appareils et les communications de groupe.

    • December 14, 2021

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

    Speaker : Céline Duguey - DGA-Rennes

    Les applications de messagerie instantanée sécurisée, telles WhatsApp ou Signal, sont devenues incontournables pour nos communications quotidiennes.<br/> Elles apportent une sécurité caractérisée notamment par le chiffrement de bout en bout, la confidentialité persistante ou encore la sécurité après compromission. Mais ces propriétés sont généralement limitées aux communications deux à deux. L[…]
Page top