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.
695 résultats
-
-
Séminaire
-
SemSecuElec
Automated software protection for the masses against side-channel attacks
Orateur : Nicolas Belleville
This presentation will present an approach and a tool that answer the need for effective, generic, and easily applicable protections against side-channel attacks. The protection mechanism is based on code polymorphism, so that the observable behaviour of the protected component is variable and unpredictable to the attacker. Our approach combines lightweight specialized runtime code generation with[…] -
-
-
Séminaire
-
SemSecuElec
Cryptographie légère intrinsèquement résistante aux attaques physiques pour l’Internet des Objets
Orateur : Benjamin Lac
Avec des applications telles que les smart phones , compteurs intelligents, capteurs et autres systèmes industriels de type SCADA, le nombre d objets connectés à Internet atteindrait les 20 milliards d ici 2020. Les contraintes de taille, coût et consommation ainsi que les problématiques de sécurité liées au déploiement de ces objets à si grande échelle ont mené à la conception de systèmes de[…] -
-
-
Séminaire
-
SemSecuElec
libecc: a flexible open-source ECC library for embedded devices
Orateur : Ryad Benadjila et Arnaud Ebalard
libecc is a software library for elliptic curves based cryptography (ECC), with an API supporting signature algorithms specified in the ISO14888-3 standard.Advanced usages of this library also include the possible implementation of elliptic curve based Diffie-Hellman protocols as well as any algorithm on top of prime fields based elliptic curves (or prime fields, or rings of integers).The[…] -
-
-
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[…] -
-
-
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
Syndrome Decoding in the Head – Shorter Signatures from Zero-Knowledge proofs
Orateur : Thibauld Feneuil - CryptoExperts et Sorbonne Université
In this talk, I will present a new zero-knowledge proof of knowledge for the syndrome decoding (SD) problem on random linear codes. Instead of using permutations like most of the existing protocols, we rely on the MPC-in-the-head paradigm in which we reduce the task of proving the low Hamming weight of the SD solution to proving some relations between specific polynomials. Specifically, we propose[…] -