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.
698 résultats
-
-
Séminaire
-
Cryptographie
Lattice-based NIST candidates: abstractions and ninja tricks
Orateur : Thomas Prest - PQShield
I will present the remaining lattice-based candidates for standardization by NIST (2 signature schemes, 5 encryption schemes). At a high level, these can all be interpreted as straightforward instantiations of decades-old paradigms. But when we look under the hood, all of them make design choices which impact their security, efficiency and portability in distinct manners; we will discuss these.[…] -
-
-
Séminaire
-
Cryptographie
Soutenance de thèse: Problème du logarithme discret sur des courbes elliptiques
Orateur : Andy Russon - Rennes 1 et Orange
L’usage des courbes elliptiques en cryptographie s’est largement répandu pour assurer la sécurité des communications ou de transactions financières. Cela est dû notamment au fait que la sécurité repose sur la difficulté du problème du logarithme discret qui permet d’utiliser les courbes elliptiques avec des paramètres qui assurent une efficacité.<br/> Dans cette thèse, nous abordons principalement[…] -
-
-
Séminaire
-
Cryptographie
Constant time techniques for lattice based cryptography
Orateur : 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[…] -
-
-
-
Séminaire
-
Cryptographie
Isogeny-based cryptography from superspecial genus-2 curves
Orateur : Wouter Castryck - KU Leuven
I will report on some first attempts to do isogeny-based cryptography in genus 2. More precisely, we will use isogeny graphs of superspecial principally polarized abelian surfaces over GF(p^2) for constructing variants of Charles, Goren and Lauter's hash function and of Jao and De Feo's SIDH key exchange protocol, both of which use supersingular elliptic curves over GF(p^2). This will be largely[…] -
-
-
Séminaire
-
Cryptographie
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
Orateur : Benjamin WESOLOWSKI - École Polytechnique Federale de Lausanne
An isogeny graph is a graph whose vertices are abelian varieties (typically elliptic curves, or Jacobians of genus 2 hyperelliptic curves) and whose edges are isogenies between them. Such a graph is "horizontal" if all the abelian varieties have the same endomorphism ring. We study the connectivity and the expander properties of these graphs. We use these results, together with a recent algorithm[…] -