Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
633 results
-
-
Seminar
-
Cryptography
Fault tolerant algorithms via decoding: Interleaving techniques
Speaker : Eleonora Guerrini - Université Montpellier
Evaluation Interpolation algorithms are a key tool for the algebraic decoding of a large class of codes, including the famous Reed Solomon codes. Recent techniques allow the use of this type of decoding in the more general setting of fault tolerant algorithms, where one has to interpolate erroneous data (potentially computed by an untrusted entity). In this talk we will present algorithms to[…] -
-
-
Seminar
-
Cryptography
Soutenance de thèse: Algebraic Cryptanalysis of the Shortest Vector Problem in Ideal Lattices
Speaker : Olivier Bernard - Rennes
-
-
-
Seminar
-
Cryptography
Isogenies over Hessian Model of Elliptic Curves
Speaker : Emmanuel Fouotsa - Université de Bamenda
In this talk we present explicit formulas for isogenies between elliptic curves in (twisted) Hessian form. We examine the numbers of operations in the base field to compute the formulas. In comparison with other isogeny formulas, we note that the obtained formulas for twisted Hessian curves have the lowest costs for processing the kernel and the X-affine formula has the lowest cost for processing[…] -
-
-
Seminar
-
Cryptography
Binary codes, hyperelliptic curves, and the Serre bound
Speaker : Ivan Pogildiakov - Rennes
TBA lien: https://seminaire-c2.inria.fr/ -
-
-
Seminar
-
Cryptography
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[…] -
-
-
Seminar
-
Cryptography
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
Speaker : Maxime Bombar - Ecole Polytechnique
Error correcting codes are well known to provide possible candidates for building quantum safe cryptographic primitives. Besides the Hamming metric which has a long-standing history, one may consider other metrics such as the rank metric. Gabidulin codes are the rank metric analogue of Reed-Solomon codes and can be efficiently decoded up to half the minimum distance. However, beyond this radius,[…] -