656 results
-
Improved Classical and Quantum Algorithms for Subset-Sum
Speaker : André Schrottenloher - INRIA
We present new classical and quantum algorithms for solving random hard instances of the subset-sum problem, in which we are given n integers on n bits and try to find a subset of them that sums to a given target. This classical NP-complete problem has several applications in cryptography and underlies the security of some proposed post-quantum cryptosystems.<br/> At EUROCRYPT 2010, Howgrave[…] -
On weak keys in QC-MDPC schemes
Speaker : Valentin Vasseur - INRIA
Quasi-cyclic moderate density parity check (QC-MDPC) codes allow the design of McEliece-like public-key encryption schemes with compact keys and a security that provably reduces to hard decoding problems for quasi-cyclic codes. Because of these features, QC-MDPC have attracted a lot of interest from the cryptographic community. In particular, the BIKE suite of key exchange mechanisms has been[…] -
libecc: a flexible open-source ECC library for embedded devices
Speaker : Ryad Benadjila et Arnaud Ebalard
libecc is a software library for elliptic curves based cryptography (ECC), with an API supporting signature algorithms specified in the ISO14888-3 standard.Advanced usages of this library also include the possible implementation of elliptic curve based Diffie-Hellman protocols as well as any algorithm on top of prime fields based elliptic curves (or prime fields, or rings of integers).The[…] -
Cryptanalysis of code-based cryptosystems using the square-code distinguisher
Speaker : Mathieu Lequesne - INRIA
Many code-based cryptosystems have been proposed recently, especially in response to the call for post-quantum cryptography standardization issued by the National Institute of Standards and Technologie. Most code-based cryptosystem rely on the same idea: an error-correcting code with some special structural properties (including good error-correction capacity) serves as the private key. This code[…] -
Constant time techniques for lattice based cryptography
Speaker : Melissa Rossi - École normale supérieure, CNRS, PSL University, Inria
NIST’s post-quantum cryptography competition has entered in its second phase, the time has come to focus more closely on practical aspects of the candidates. On the lattice-based side, certain schemes chose to implement discrete Gaussian distributions which allow better parameters and security reductions. However, this advantage has also proved to be their Achilles’ heel, as discrete Gaussians[…] -
The Revival of Quadratic Fields Cryptography
Speaker : Guilhem Castagnos - Université Bordeaux 1
More than 30 years ago, Buchmann and Williams proposed using ideal class groups of imaginary quadratic fields in cryptography with a Diffie-Hellman style key exchange protocol. After several twists, there has been in recent years a new interest in this area. This rebirth is mainly due to two features. First, class groups of imaginary quadratic fields allow the design of cryptographic protocols[…]