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.
750 résultats
-
-
Séminaire
-
Cryptographie
Algorithms for polynomial selection in the number field sieve
Orateur : Shi Bai - Australian National University
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The running-time of the number field sieve depends on the quality of the chosen polynomials. The quality of the chosen polynomials can be modeled in terms of size and root properties. In this talk, we will describe some[…] -
-
-
Séminaire
-
Cryptographie
Fonction de hachage et protection de la vie privée
Orateur : Cédric Lauradoux - INRIA
Les fonctions de hachage à sens unique sont très utilisées pour générer des pseudonymes et anonymiser des données. Le résultat obtenu est rarement à la hauteur des espoirs mis dans le hachage. Dans de nombreux cas, on a pu ré-identifier des bases de données anonymiser avec des fonctions de hachage. Dans cet exposé, nous reviendrons sur les garanties d'anonymat (anonymity-set-size ou k-anonymity)[…] -
-
-
-
Séminaire
-
Cryptographie
The SKINNY Family of Block Ciphers
Orateur : Jérémy Jean - ANSSI
We present a new tweakable block cipher family SKINNY, whose goal is to compete with NSA recent design SIMON in terms of hardware/software performances, while proving in addition stronger security guarantees with regards to differential/linear attacks.<br/> SKINNY has flexible block/key/tweak sizes and can also benefit from very efficient threshold implementations for side-channels protection.[…] -
-
-
Séminaire
-
Cryptographie
Cryptography, Encryption, and Big Data
Orateur : Hoeteck Wee - ENS
We live in an era of "Big Data", wherein a deluge of data is being generated, collected, and stored all around us. In order to protect this data, we need to encrypt it. This raises a fundamentally new challenge in cryptography: Can we encrypt data while enabling fine-grained access control and selective computation, as is necessary to protect big, complex data? In this talk, I will present my work[…] -
-
-
Séminaire
-
Cryptographie
Broadcast encryption: combinatorial vs. algebraic methods
Orateur : Duong-Hieu Phan - ENS
We consider a generalisation of the encryption from "one-to-one'' to "one-to-many'' communication, i.e. broadcast encryption. The objective is to allow a center to send secret messages to a large number of receivers. The security notion in “one-to-many” communications needs to be extended beyond the notion of confidentiality in “one-to-one” encryption in order to meet practical requirements. Two[…] -