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.
634 résultats
-
-
Séminaire
-
Cryptographie
Middle-Product Learning with Rounding Problem and its Applications
Orateur : Katharina Boudgoust - Univ Rennes, CNRS, IRISA
This talk focuses on a new variant of the Learning With Errors (LWE) problem, a fundamental computational problem used in lattice-based cryptography.<br/> At Crypto17, Roşca et al. introduced the Middle-Product LWE problem (MP-LWE), whose hardness is based on the hardness of the Polynomial LWE (P-LWE) problem parameterized by a large set of polynomials, making it more secure against the possible[…] -
-
-
Séminaire
-
Cryptographie
Soutenance de thèse: Conception de courbes elliptiques et applications
Orateur : Rémi Clarisse - Rennes
Le thème de la sécurité de l’information est prédominant dans nos vies actuelles. En particulier, les utilisateurs de service, plus précisément en ligne, s’attendent de plus en plus à ce que leurs données à caractère personnel soient traitées dignement et avec leur consentement. Cela incite donc à concevoir des systèmes se pliant à de telles exigences. Le recours à la cryptographie permet de[…] -
-
-
Séminaire
-
Cryptographie
Computing isogenies from modular equations in genus 2
Orateur : Jean Kieffer - Université Bordeaux 1
Given two l-isogenous elliptic curves, a well-known algorithm of Elkies uses modular polynomials to compute this isogeny explicitly. In this work, we generalize his ideas to Jacobians of genus 2 curves. Our algorithms works for both l-isogenies and (in the RM case) cyclic isogenies, and uses Siegel or Hilbert type modular equations respectively. This has applications for point counting in genus 2:[…] -
-
-
Séminaire
-
Cryptographie
Key recovery from partial information
Orateur : Gabrielle De Michelli - UC San Diego
The security of deployed protocols not only relies on the hardness of the underlying mathematical problem but also on the implementation of the algorithms involved. Many fast modular exponentiation algorithms have piled up over the years and some implementations have brought vulnerabilities that are exploitable by side-channel attacks, in particular cache attacks.<br/> In this talk, we consider[…] -
-
-
Séminaire
-
Cryptographie
Traceable Constant-Size Multi-Authority Credentials
Orateur : Chloé Hébant - ENS
Many attribute-based anonymous credential (ABC) schemes have been proposed allowing a user to prove the possession of some attributes, anonymously. They became more and more practical with, for the most recent papers, a constant-size credential to show a subset of attributes issued by a unique credential issuer. However, proving possession of attributes coming from K different credential issuers[…] -
-
-
Séminaire
-
Cryptographie
Improved Classical and Quantum Algorithms for Subset-Sum
Orateur : 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[…] -