Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
707 résultats
-
-
Séminaire
-
Cryptographie
Investigating LWE without Modular Reduction
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
A Modular Security Analysis of EAP and IEEE 802.11
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
Complete Addition Formulas for Prime Order Elliptic Curves
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
Short McEliece key from algebraic geometry codes with automorphism
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
Algebraic Decoding of Folded Gabidulin Codes
Orateur : Hannes Bartz - Technische Universität München
Folded Gabidulin codes were proposed by Mahdavifar and Vardy in 2012. Beside the code construction an interpolation-based decoding scheme that can correct rank errors beyond the unique decoding radius for low code rates was presented.<br/> In this talk we present an efficient interpolation-based decoding algorithm for folded Gabidulin codes that can correct rank errors beyond half the minimum rank[…] -
-
-
Séminaire
-
Cryptographie
Efficient Implementation of Ideal Lattice-Based Cryptography on Embedded Devices
Orateur : Thomas Pöppelmann - Infineon Technologies AG
Novel public-key cryptosystems beyond RSA and ECC are urgently required to ensure long-term security in the era of quantum computing. One alternative to such established schemes is ideal lattice-based cryptography which offers elegant security reductions and versatile cryptographic building blocks such as the ring learning with errors (RLWE) problem. In this talk we will give an overview on[…] -