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.
762 résultats
-
-
Séminaire
-
Cryptographie
Fault tolerant algorithms via decoding: Interleaving techniques
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Orateur : Emmanuel Thomé - INRIA Nancy
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not[…] -
-
-
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, to date,[…] -
-
-
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 Curve[…] -
-
-
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[…] -