Filter by content type

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

Remove all filters

702 results

    • Seminar

    • Cryptography

    Locally recoverable codes from curves

    • October 20, 2017

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

    Speaker : Everett Howe - Center for Communications Research, San Diego

    A locally recoverable code, or LRC, is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. I will explain why LRCs are important for applications such as cloud data storage, and I will present several constructions of locally recoverable codes from Galois covers of curves over finite[…]

    • 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

    Class Group Computations in Number Fields and Applications to Cryptology

    • December 08, 2017

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

    Speaker : Alexandre Gelin - Versailles-Saint-Quentin-en-Yvelines

    In this talk, we focus on class group computations in number fields. We start by describing an algorithm for reducing the size of a defining polynomial of a number field. There exist infinitely many polynomials that define a specific number field, with arbitrarily large coefficients, but our algorithm constructs the one that has the absolutely smallest coefficients. The advantage of knowing such a[…]

    • Seminar

    • Cryptography

    Fonction de hachage et protection de la vie privée

    • April 22, 2016

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

    Speaker : Cédric Lauradoux - INRIA

    Les fonctions de hachage à sens unique sont très utilisées pour générer des pseudonymes et anonymiser des données. Le résultat obtenu est rarement à la hauteur des espoirs mis dans le hachage. Dans de nombreux cas, on a pu ré-identifier des bases de données anonymiser avec des fonctions de hachage. Dans cet exposé, nous reviendrons sur les garanties d'anonymat (anonymity-set-size ou k-anonymity)[…]

    • Seminar

    • Cryptography

    Soutenance de thèse

    • July 03, 2015

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

    Speaker : Tristan Vaccon - IRMAR

    • 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.[…]
Page top