Table of contents

  • This session has been presented November 08, 2024 (13:45 - 14:45).

Description

  • Speaker

    Valerie Gilchrist - ULB

Public key cryptography relies on using mathematical functions that are easy to compute but hard to invert. A recent work by D'Alconzo, Flamini, and Gangemi attempted to build such a function from tensors and use it to create a commitment scheme. In this talk, we will review their construction and present an attack on it, rendering it completely insecure. We will also offer an approach to repairing it.

The talk is based on the work from https://eprint.iacr.org/2024/337, but no prior knowledge is necessary.

Practical infos

Next sessions

  • Journées C2: pas de séminaire

    • April 03, 2026 (13:45 - 14:45)

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

  • Endomorphisms via Splittings

    • April 10, 2026 (13:45 - 14:45)

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

    Speaker : Min-Yi Shen - No Affiliation

    One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]

    • Cryptography

Show previous sessions
Page top