Table of contents

  • This session has been presented March 25, 2011.

Description

  • Speaker

    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.

Next sessions

  • Polytopes in the Fiat-Shamir with Aborts Paradigm

    • November 29, 2024 (13:45 - 14:45)

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

    Speaker : Hugo Beguinet - ENS Paris / Thales

    The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution.  Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]

    • Cryptography

    • Asymmetric primitive

    • Mode and protocol

  • Post-quantum Group-based Cryptography

    • December 20, 2024 (13:45 - 14:45)

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

    Speaker : Delaram Kahrobaei - The City University of New York

Show previous sessions
Page top