Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
713 results
-
-
Seminar
-
Cryptography
Generation of Prime Numbers on Portable Devices
Speaker : Marc Joye - Thomson R&D France
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despite decades of intense mathematical studies on primality testing and an observed progressive intensification of cryptography, prime number generation algorithms remain scarcely investigated and most real-life[…] -
-
-
Seminar
-
Cryptography
Vérification formelle de compilateurs
Speaker : Xavier Leroy - INRIA Rocquencourt
Tous les programmeurs s'attendent à ce que les compilateurs et autres outils de génération de code produisent du code exécutable qui se comporte exactement comme prescrit par le programme source. Ce n'est malheureusement pas toujours le cas : des bugs dans le compilateur peuvent conduire à la production de code machine incorrect à partir d'un source correct. Ce cas de figure est particulièrement[…] -
-
-
Seminar
-
Cryptography
Identification de diffusion illicite : le fingerprinting et les codes centrés
Speaker : Fabien Galand - IRISA
Dans le contexte de la distribution de contenu numérique, il est souvent souhaitable de pouvoir tracer l'origine des copies. Par exemple, lors de la vente de vidéos, l'acheteur n'est pas autorisé à redistribuer ce qu'il vient d'acheter. Lorsqu'il le fait, on souhaite pouvoir, à partir d'une des copies diffusées, l'identifier comme étant à l'origine de cette distribution illicite. Pour résoudre ce[…] -
-
-
Seminar
-
Cryptography
An l-adic CM construction for genus 2
Speaker : David Kohel - University of Sydney
We recall recent work on CM constructions using canonical lifts of the Frobenius isogeny: for p = 2 with Gaudry, Houtmann, Ritzenthaler, and Weng, and generalisation to p = 3 with Carls and Lubicz. I will explain how to extend this to (l,l)-isogenies for l = 2, 3 coprime to the characteristic. -
-
-
Seminar
-
Cryptography
Symbolic verification of Diffie-Hellman-based group key exchange
Speaker : Yassine Lakhnech - VERIMAG
We discuss the cryptographic soundness of a symbolic model for Diffie-Hellman based key exchange protocols including symmetric encryption. Our main tool is a new dynamic variation of the decisional Diffie-Hellman problem useful for group protocols. -
-
-
Seminar
-
Cryptography
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
Speaker : Oded Regev - Tel Aviv University
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learning from parity with error' problem to higher moduli. It can also be viewed as the problem of decoding from a random linear code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however[…] -