Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
700 results
-
-
Seminar
-
Cryptography
Deformation theory and the computation of zeta functions
Speaker : Alan Lauder - Oxford University
The problem of computing the zeta function of a variety over a finite field has attracted considerable interest in recent years, motivated in part by an application in cryptography. (In less fancy language, the problem is just to compute the number of solutions to a system of polynomial equations over a finite field.) I will discuss a new algorithm for computing zeta functions which is based upon[…] -
-
-
Seminar
-
Cryptography
Sécurité informatique, de la vérification formelle de protocoles cryptographiques à la détection d'intrusions en temps réel
Speaker : Jean Goubeault-Larrecq - ENS Cachan
Le but de cet exposé est de présenter très grossièrement deux aspects de la recherche en sécurité menée au LSV (laboratoire spécification et vérification, ENS Cachan et CNRS UMR 8643) et dans le projet INRIA SECSI.<br/> Un premier aspect est la vérification automatique de protocoles cryptographiques. L'idée est au départ de vérifier qu'un protocole est sûr sous des hypothèses simplificatrices[…] -
-
-
Seminar
-
Cryptography
Un état de l'art de la cryptographie à base de réseaux
Speaker : Phong N'Guyen - Ecole Normale Supérieure
Un réseau est un sous-groupe discret de R^n. Les réseaux ont de nombreuses applications en cryptologie. Pendant longtemps, ces applications sont restées cantonnées à l'attaque des cryptosystèmes à clef publique à base de theorie des nombres. Mais paradoxalement, une cryptographie à base de reseaux est depuis apparue en 1996. Dans cet exposé, nous dresserons un état-de-l'art de la cryptographie à[…] -
-
-
Seminar
-
Cryptography
Courbes elliptiques et attaques par canaux cachés
Speaker : Marc Joye - Gem+
Provable security becomes more and more popular in the cryptographic community. As exemplified by the NESSIE project, it is now common to see it as an attribute of a cryptosystem. Provable security is at the protocol level; a harder task may be to evaluate the security of a cryptosystem at the implementation level. Rather than considering a cryptosystem as a black-box, we may assume that some[…] -
-
-
Seminar
-
Cryptography
Packings on the Grassmann manifold: an interesting approach for non coherent space-time coding
Speaker : Jean-Claude Belfiore - ENST
The need of high data rates on the radio channel (WiFi and its future for example) explains the increasing number of researchers working on space-time codes. Preparing Wireless IP systems, some companies and some researchers are promoting the use of non coherent space-time codes.<br/> We show that designing a non coherent space-time code is equivalent to finding some good packings on the Grassmann[…] -
-
-
Seminar
-
Cryptography
Efficient arithmetic on (hyper-)elliptic curves over finite fields
Speaker : Tanja Lange - Ruhr-Universität Bochum
The talk will be concerned with arithmetic on elliptic and hyperelliptic curves. We show how fast the arithmetic can get by clever choices of the coordinates and present special kinds of curves which allow even faster arithmetic using the Frobenius endomorphism. For elliptic curves this has been used to achieve fast arithmetic for the past years. However, so far arithmetic in the ideal class group[…] -