Description
Group-based cryptography is a relatively new family in post-quantum cryptography, with high potential. I will give a general survey of the status of post-quantum group-based cryptography and present some recent results.
In the second part of my talk, I speak about Post-quantum hash functions using special linear groups. This hash function is a generalization of Tillich-Zemor hash function as well as some ideas of Gonen-Lauter-Charles which uses expander graphs.
Next sessions
-
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
Speaker : 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
-