599 résultats
-
Lilliput: Advances in Security and Performance Analysis
Orateur : Julien Francq - Airbus CyberSecurity
Lilliput is a block cipher that has been published in 2015 in IEEE Transactions in Computers with Thierry Berger and Marine Minier, and the seminal paper has been cited 6 times for now. This talk will summarize the results of the third-party cryptanalysis and implementations, and will show that Lilliput is still an efficient and secure cryptographic primitives. -
CRYSTALS: Dilithium and Kyber
Orateur : Damien Stehlé - ENS de Lyon
Kyber -- a Key Exchange Mechanism -- and Dilithium -- a digital signature -- are the two components of the Cryptographic Suite for Algebraic Lattices (CRYSTALS). I will present the intractable problems underlying their security, overview their design and comment their practical performance. The talk is based on the following articles:<br/> https://eprint.iacr.org/2017/633.pdf<br/&gt;[…] -
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[…] -
Locally recoverable codes from curves
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[…] -
Middle-Product Learning With Errors
Orateur : 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[…] -
Evolution de la monnaie électronique divisible
Orateur : Olivier Sanders - Orange
Les systèmes de paiement électronique ont été massivement adoptés par le grand-public mais sont pourtant loin d’être anodins du point de vue du respect de la vie privée. En effet l’entité gérant ces systèmes peut déduire de chaque paiement un grand nombre d’informations sur son auteur, comme sa localisation, ses goûts et même, dans certains cas, son état de santé. Pourtant, paiement électronique[…]