Description
In this talk, we present methods for computing Humbert surface equations and isogeny relations using Fourier expansions of Siegel modular forms. Both provide improvements to the running time of the CRT algorithm for computing Igusa class polynomials, which we illuminate with an example.
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
-