Filter by content type

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

Remove all filters

655 results

    • Seminar

    • Cryptography

    Some new results on cube attacks against Trivium

    • December 14, 2018

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

    Speaker : Tian Tian - Université de Zhengzhou

    Trivium is a bit oriented synchronous stream cipher designed by Cannière and Preneel. It is one of the eSTREAM hardware-oriented finalists and an International Standard under ISO/IEC 29192-3:2012. Cube attacks are an important type of key recovery attack against Trivium. First, I will give a survey on cube attacks against Trivium. Second, I will present our recent results including an algebraic[…]
    • Seminar

    • Cryptography

    Cryptanalyse algébrique de DAGS

    • September 27, 2019

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

    Speaker : Magali Bardet - université de Rouen

    Elise Barelli et Alain Couvreur ont présenté une attaque dévastatrice sur le cryptosystème DAGS soumis au 1er tour de la compétition du NIST autour d'algorithmes de cryptographie post-quantiques. Je présenterai une explication précise de la résolution par bases de Gröbner de leur modélisation algébrique, expliquant l'efficacité de l'attaque pour les paramètres de DAGS publiés au NIST.<br/> lien:[…]
    • Seminar

    • Cryptography

    Calcul de r-isogénies à l'aide de la \ell-torsion.

    • January 27, 2017

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

    Speaker : Cyril Hugounenq - Université de Versailles

    Après des rappels sur les courbes elliptiques et les isogénies, on va présenter le problème que l'on veut résoudre: soit deux courbes elliptiques E,E' définies sur un corps fini (de caractéristique p) que l'on sait r-isogénes alors on souhaite calculer la r-isogénie qui les relie. De nombreux algorithmes ont résolu ce problème par le passé notamment l'algorithme de Couveignes de 1996 qui sera[…]
    • Seminar

    • Cryptography

    Middle-Product Learning With Errors

    • October 13, 2017

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

    Speaker : Miruna Rosca - ENS de Lyon

    We introduce a new variant MP-LWE of the Learning With Errors problem (LWE) making use of the Middle Product between polynomials modulo an integer q. We exhibit a reduction from the Polynomial-LWE problem (PLWE) parametrized by a polynomial f, to MP-LWE which is defined independently of any such f. The reduction only requires f to be monic with constant coefficient coprime with q. It incurs a noise[…]
    • Seminar

    • Cryptography

    Improving greedy nonrandomness detectors for stream ciphers

    • March 24, 2017

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

    Speaker : Paul Stankovski - Université de Lund

    We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the[…]
    • Seminar

    • Cryptography

    Towards the Implementation of Efficient and Distributable Pairing-based Crypto Library

    • December 01, 2017

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

    Speaker : Al-Amin Khandaker - Okayama University

    Pairing-based cryptography is popular among the cryptographic protocol researchers for its eccentric provable security. Protocol side researchers often see pairing as a black box. They often need to test the correctness of their proposal. Typically, mathematicians and cryptography engineers try to make the underlying operations of pairing-based crypto efficient. In addition, different types of[…]