Je recherche

719 résultats

• • Séminaire

  • Cryptographie

  A Modular Security Analysis of EAP and IEEE 802.11

  • 07 avril 2017

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

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

• • Séminaire

  • Cryptographie

  Short McEliece key from algebraic geometry codes with automorphism

  • 26 janvier 2018

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

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

• • Séminaire

  • Cryptographie

  Complete Addition Formulas for Prime Order Elliptic Curves

  • 09 décembre 2016

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

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

• • Séminaire

  • Cryptographie

  Locally recoverable codes from curves

  • 20 octobre 2017

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

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

• • Séminaire

  • Cryptographie

  Gröbner Bases Techniques in Post-Quantum Cryptography

  • 12 juin 2015

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

  Orateur : Ludovic Perret - LIP6

  After the publication of Shor's algorithm, it became evident the most popular public-key cryptographic systems that rely on the integer factorization problem or on the discrete logarithm problem would be easily solvable using large enough quantum computers (if such quantum computers are ever built). That triggered a vivid interest in the research of cryptographic algorithms (mostly public-key[…]

• • Séminaire

  • Cryptographie

  Sanitization of FHE Ciphertexts

  • 12 février 2016

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

  Orateur : Damien Stehlé - ENS Lyon

  By definition, fully homomorphic encryption (FHE) schemes support homomorphic decryption, and all known FHE constructions are bootstrapped from a Somewhat Homomorphic Encryption (SHE) scheme via this technique. Additionally, when a public key is provided, ciphertexts are also re-randomizable, e.g. by adding to them fresh encryptions of~$0$. From those two operations we devise an algorithm to[…]