Description
The purpose of the talk is to present the following heuristic result.<br/> Let a, b in R with 0 < a < b. Then discrete logarithms in E(F_q^n), where q is a prime power, a log_2(q) \leq n \leq b \log_2(q)$ and E/F_q^n is any elliptic curve over F_q^n, can be solved in probabilistic subexponential time L[3/4].<br/> The algorithm is a variant of a recent index calculus algorithm by Gaudry. The main difference is that we increase the factor base.
Prochains exposés
-
Séminaire C2 à INRIA Paris
Emmanuel Thomé et Pierrick Gaudry Rachelle Heim Boissier Épiphane Nouetowa Dung Bui Plus d'infos sur https://seminaire-c2.inria.fr/ -
Attacking the Supersingular Isogeny Problem: From the Delfs–Galbraith algorithm to oriented graphs
Orateur : Arthur Herlédan Le Merdy - COSIC, KU Leuven
The threat of quantum computers motivates the introduction of new hard problems for cryptography.One promising candidate is the Isogeny problem: given two elliptic curves, compute a “nice’’ map between them, called an isogeny.In this talk, we study classical attacks on this problem, specialised to supersingular elliptic curves, on which the security of current isogeny-based cryptography relies. In[…]-
Cryptography
-