Table of contents

  • This session has been presented December 09, 2005.

Description

  • Speaker

    Gerhard Frey - Essen University

Groups of prime order with a bilinear structure are interesting objects for public key cryptography. In the first part of the lecture we shall explain how the pairing on points of the Jacobian variety which is usually called "Tate-pairing" can be got in a p- adic setting by the Lichtenbaum pairing. On the one hand side this setting gives us more freedom for its computation which leads to more efficiency if the genus of the underlying curve is larger than 1.<br/> On the other side it shows that the Brauer groups of local fields arises in a natural way in the world of discrete logarithms based on ideal class groups. This, and the great importance of Brauer groups for number theory, motivates that one should try to investigate them computationally. In the second part of the lecture we shall present index-calculus methods for Brauer groups with applications to the classical discrete logarithm and to the computation of Euler's totient function.

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