Table of contents

  • This session has been presented February 01, 2013.

Description

  • Speaker

    Nicolas Mascot - Université Bordeaux I

Nous décrivons un algorithme permettant de calculer les représentations galoisiennes associées à une forme modulaire parabolique propre, et nous étudions un problème associé, à savoir le calcul des coefficients de Fourier de cette forme modulo un petit nombre premier.

Next sessions

  • CryptoVerif: a computationally-sound security protocol verifier

    • September 05, 2025 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : 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

Show previous sessions
Page top