Description
n 2001 K. Kedlaya suggested an algorithm to compute the zeta function of a hyperelliptic curve over a finite field of small odd characteristic. The basic idea of his approach is to compute the explicit Frobenius action on the Monsky-Washniter cohomology in dimension one. Later his method was extended by P. Gaudry and N. Guerel to superelliptic curve and by J. Denef and F. Vercauteren to hyperelliptic curves in even characteristic.
Prochains exposés
-
CryptoVerif: a computationally-sound security protocol verifier
Orateur : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-