Sommaire

  • Cet exposé a été présenté le 25 mars 2011.

Description

  • Orateur

    Christiaan van de Woestijne - Montanuniversität Leoben

It is a curious fact that most efficient algorithms for solving algebraic equations over finite fields are probabilistic. In this talk, I will give an overview over deterministic techniques that are applicable. The case of constructing rational points on elliptic curves is especially relevant for cryptographic applications. I will give a detailed exposition of my algorithm for this purpose and also discuss the complexity from various viewpoints.

Prochains exposés

  • TBA

    • 18 septembre 2026 (13:45 - 14:45)

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

    Orateur : Eran Lambooij - Inria

    • Cryptography

  • TBA

    • 25 septembre 2026 (13:45 - 14:45)

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

    Orateur : Anmoal Porwal - Technical University of Munich

    • Cryptography

    • Asymmetric primitive

Voir les exposés passés
Haut de page