Speaker:
Sabrina Kunzweiler
Zugehörigkeit:
Inria Bordeaux and Université de Bordeaux
Datum:
Don, 05/12/2024 - 09:45 - 10:30
The hardness of computing discrete logarithms in a prime order group builds the basis of many constructions in cryptography.
While there exist efficient quantum algorithms for solving this problem, the situation is different when we consider group actions:
Given two elements x,y in a set X, and a group G acting on X, the "group-action DLOG problem" asks to find a group element g∈G so that y=gx (if it exists).
In this talk, the focus will be on group actions that are used in isogeny-based cryptography.