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.
667 résultats
-
-
Séminaire
-
Cryptographie
Discrete logarithm computation in finite fields GF(p^k) with NFS
Orateur : Aurore Guillevic - INRIA
Pairings on elliptic curves are involved in signatures, NIZK, and recently in blockchains (ZK-SNARKS).<br/> These pairings take as input two points on an elliptic curve E over a finite field, and output a value in an extension of that finite field. Usually for efficiency reasons, this extension degree is a power of 2 and 3 (such as 12,18,24), and moreover the characteristic of the finite field has[…] -
-
-
Séminaire
-
Cryptographie
Post-quantum cryptography based on supersingular isogeny problems?
Orateur : Christophe Petit - University of Birmingham
The security of many cryptographic protocols in use today relies on the computational hardness of mathematical problems such as integer factorization. These problems can be solved using quantum computers, and therefore most of our security infrastructures will become completely insecure once quantum computers are built. Post-quantum cryptography aims at developing security protocols that will[…] -
-
-
Séminaire
-
Cryptographie
Towards the Implementation of Efficient and Distributable Pairing-based Crypto Library
Orateur : Al-Amin Khandaker - Okayama University
Pairing-based cryptography is popular among the cryptographic protocol researchers for its eccentric provable security. Protocol side researchers often see pairing as a black box. They often need to test the correctness of their proposal. Typically, mathematicians and cryptography engineers try to make the underlying operations of pairing-based crypto efficient. In addition, different types of[…] -
-
-
Séminaire
-
Cryptographie
Improving greedy nonrandomness detectors for stream ciphers
Orateur : Paul Stankovski - Université de Lund
We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the[…] -
-
-
Séminaire
-
Cryptographie
Soutenance de thèse : Algorithmes de recherche sur bases de données chiffrées
Orateur : Raphaël Bost - Université Rennes 1
La recherche sur les bases de données chiffrées vise à rendre e cace une tâche apparemment simple : déléguer le stockage de données à un serveur qui ne serait pas de con ance, tout en conservant des fonctionnalités de recherche. Avec le développement des services de stockage dans le Cloud, destinés aussi bien aux entreprises qu’aux individus, la mise au point de solutions e caces à ce problème est[…] -
-
-
Séminaire
-
Cryptographie
Encryption Switching Protocols
Orateur : Geoffroy Couteau - ENS
(Joint work with Thomas Peters, and David Pointcheval) We put forth a novel cryptographic primitive: encryption switching protocol (ESP), allowing to switch between two encryption schemes. Intuitively, this two-party protocol converts given ciphertexts from one scheme into ciphertexts of the same messages in the other scheme, for any polynomial number of switches, in any direction. Although ESP is[…] -