592 résultats
-
Calibration Done Right: Noiseless Flush+Flush Attacks
Orateur : Guillaume Didier
Caches leak information through timing measurements and so-called side-channel attacks. Several primitives exist with different requirements and trade-offs. Flush+Flush is a stealthy and fast cache attack primitive that uses the timing of the clflush instruction depending on the presence of a line in the cache. However, the CPU interconnect plays a bigger role than thought in these timings, and[…] -
SideLine and the advent of software-induced hardware attacks
Orateur : Joseph Gravellier
In this talk, we will discuss software-induced hardware attacks and their impact for IoT, cloud and mobile security. More specifically, I will introduce SideLine, a new power side-channel attack vector that can be triggered remotely to infer cryptographic secrets. SideLine is based on the intentional misuse of delay-lines components embedded in SoCs that use external memory. I will explain how we[…] -
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[…] -
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[…] -
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[…] -
Candidats NIST basés sur les réseaux: choix de conception et astuces de ninja
Orateur : Thomas Prest. - PQShield
Parmi les 26 schémas post-quantique toujours considérés pour standardisation par le NIST, 12 sont basés sur les réseaux (3 schémas de signature et 9 schémas de chiffrement). Cette présentation leur est consacrée. A haut niveau, tous peuvent être interprétés comme des instanciations directes de paradigmes bien établis. Mais une analyse plus attentive révèle que chacun d'eux fait des choix de[…]