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
Divisible E-Cash from Constrained Pseudo-Random Functions
Orateur : Olivier Sanders - Orange
Electronic cash (e-cash) is the digital analogue of regular cash which aims at preserving users' privacy. Following Chaum's seminal work, several new features were proposed for e-cash to address the practical issues of the original primitive. Among them, divisibility has proved very useful to enable efficient storage and spendings. Unfortunately, it is also very difficult to achieve and,[…] -
-
-
Séminaire
-
Cryptographie
Post-Quantum Cryptography Hardware: Monolithic Implementations vs. Hardware-Software Co-Design
Orateur : Markku-Juhani Saarinen - PQShield
At PQShield, we've developed dedicated coprocessor(s) for lattice schemes, hash-based signatures, and code-based cryptography. These cryptographic modules are commercial rather than academic and designed to meet customer specifications such as a specific performance profile or Common Criteria and FIPS security certification requirements. Hardware implementations of legacy RSA and Elliptic[…] -
-
-
Séminaire
-
Cryptographie
Public Key Encryption with Flexible Pattern Matching
Orateur : Elie Bouscatié - Orange
Many interesting applications of pattern matching (e.g. deep-packet inspection or medical data analysis) target very sensitive data. In particular, spotting illegal behaviour in internet traffic conflicts with legitimate privacy requirements, which usually forces users to blindly trust an entity that fully decrypts their traffic in the name of security. The compromise between traffic analysis and[…] -
-
-
Séminaire
-
Cryptographie
On weak keys in QC-MDPC schemes
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Soutenance de thèse: Theoretical Hardness of Algebraically Structured Learning With Errors
Orateur : Katharina Boudgoust - Rennes
The main focus of this PhD thesis lies on the computational problem Learning With Errors (LWE). It is a core building block of lattice-based cryptography, which itself is among the most promising candidates to replace current cryptographic protocols once large-scale quantum computers may be available. The contributions of the present work are separated into two different parts. First, we study the[…] -
-
-
Séminaire
-
Cryptographie
The generalized quaternion isogeny path problem.
Orateur : Antonin Leroux - LIX
The correspondence between maximal orders in a quaternion algebra and supersingular elliptic curves has uncovered new perspectives in the field of isogeny-based cryptography. The KLPT algorithm of Kohel et al. in 2014 introduces an algorithm solving the quaternion isogeny path problem in polynomial time. Studying this problem has applications both constructive and destructive. It has allowed to[…] -