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.
673 résultats
-
-
Séminaire
-
SemSecuElec
Bridging Deep Learning and Classical Profiled Side-Channel Attacks
Orateur : Gabriel Zaid
Over the recent years, the cryptanalysis community leveraged the potential of research on Deep Learning to enhance attacks. In particular, several studies have recently highlighted the benefits of Deep Learning based Side-Channel Attacks (DLSCA) to target real-world cryptographic implementations. While this new research area on applied cryptography provides impressive result to recover a secret[…] -
-
-
Séminaire
-
SemSecuElec
Lattice-based NIST candidates: abstractions and ninja tricks
Orateur : Thomas Prest
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
-
SemSecuElec
Security of Hardware/Software Interfaces : Research Chair of the Cybersecurity Research Cluster
Orateur : Guillaume Hiet
We proposed to host a thematic semester on attacks based on the interaction between software and hardware. The goal would be to host one workshop, one summer school for young researchers, as well as multiple seminars and longer stays for researchers, spanning September 2019 to March or April 2020. This thematic semester will be funded by the DGA in the context of the Cybersecurity Research Cluster[…] -
-
-
Séminaire
-
Cryptographie
Binary codes, hyperelliptic curves, and the Serre bound
Orateur : Ivan Pogildiakov - Rennes
TBA lien: https://seminaire-c2.inria.fr/ -
-
-
Séminaire
-
Cryptographie
On Rejection Sampling in Lyubashevsky's Signature Scheme
Orateur : Julien Devevey - ENS de Lyon
Lyubashevsky’s signatures are based on the Fiat-Shamir with aborts paradigm, whose central ingredient is the use of rejection sampling to transform (secret-key-dependent) signature samples into samples from a secret-key-independent distribution. The choice of these two underly- ing distributions is part of the rejection sampling strategy, and various instantiations have been considered up to this[…] -
-
-
Séminaire
-
Cryptographie
PMNS for efficient arithmetic and small memory cost
Orateur : Fangan Yssouf Dosso - Ecole des Mines de Saint-Etienne
The Polynomial Modular Number System (PMNS) is an integer number system which aims to speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, E is a monic polynomial with integer coefficients, having g as a root modulo p. Most of the work done on PMNS focus on polynomials E such that E(X) = X^n – l, where l is[…] -