Table of contents

  • This session has been presented January 09, 2009.

Description

  • Speaker

    Ben Smith - Ecole Polytechnique

Until recently, the best known algorithm for solving a Discrete Logarithm Problem (DLP) in the Jacobian of a hyperelliptic genus 3 curve ran in time \softO(q^(4/3)), while the best known algorithm for non-hyperelliptic genus 3 curves ran in time \softO(q). In this talk, we describe an efficient algorithm for moving instances of the DLP from a hyperelliptic genus 3 Jacobian to a non-hyperelliptic Jacobian, by means of an explicit isogeny. This allows us to solve the DLP on a large class of hyperelliptic genus 3 Jacobians in time \softO(q).

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