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

    Improved Cryptanalysis of Rank Metric Schemes Based on Gabidulin Codes.

    • February 03, 2017

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

    Speaker : Hervé Talé Kalachi - Université de Rouen et Université de Yaoundé, Cameroun

    In this presentation, we prove that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. with the goal to resist to Overbeck’s structural attack are actually still vulnerable to that attack. We show that by applying the Frobenius operator appropriately on the public key, it is possible to build a Gabidulin[…]
    • Seminar

    • Cryptography

    Investigating LWE without Modular Reduction

    • October 27, 2017

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

    Speaker : Jonathan Bootle - UCL

    The LWE problem is ubiquitous in lattice cryptography. In order to try and design more efficient cryptosystems, an increasing number of LWE variants are being considered. In this talk, we consider a variant of LWE over the integers i.e. without modular reduction. We explain why the problem is easy to solve with a large number of samples, and show how this leads to a side-channel attack on the[…]
    • Seminar

    • Cryptography

    A Modular Security Analysis of EAP and IEEE 802.11

    • April 07, 2017

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

    Speaker : Haakon Jacobsen - TBD

    The Extensible Authentication Protocol (EAP) is a widely used three-party authentication framework that allows a client to connect to a wireless access point it does not share a secret with, using a mutually trusted server. EAP is often found in enterprise networks or large organizations to provide central key-management and user authentication; one prime example being the eduroam network.<br/> In[…]
    • Seminar

    • Cryptography

    Complete Addition Formulas for Prime Order Elliptic Curves

    • December 09, 2016

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

    Speaker : Joost Renes - University of Nijmegen

    An elliptic curve addition law is said to be complete if it correctly computes the sum of any two points in the elliptic curve group. One of the main reasons for the increased popularity of Edwards curves in the ECC community is that they can allow a complete group law that is also relatively efficient (e.g., when compared to all known addition laws on Edwards curves). Such complete addition[…]
    • Seminar

    • Cryptography

    Short McEliece key from algebraic geometry codes with automorphism

    • January 26, 2018

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

    Speaker : elise barelli - INRIA Saclay

    In 1978, McEliece introduced a public key encryption scheme based on linear codes and suggested to use classical Goppa codes, ie: subfield subcodes of algebraic geometric (AG) codes built on a curve of genus 0. This proposition remains secure and in order to have a generalization of classical Goppa codes, in 1996, H. Janwa and O. Moreno suggested to use subfield subcode of AG codes, which we call[…]
    • 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[…]