Description
NIST’s post-quantum cryptography competition has entered in its second phase, the time has come to focus more closely on practical aspects of the candidates. On the lattice-based side, certain schemes chose to implement discrete Gaussian distributions which allow better parameters and security reductions. However, this advantage has also proved to be their Achilles’ heel, as discrete Gaussians pose serious challenges in terms of protection against timing attacks. In this talk, I will review the different timing weaknesses and present several constant-time techniques including a new approach to polynomially approximate transcendental functions (https://eprint.iacr.org/2019/511.pdf). I will emphasis on the application of these techniques on BLISS and FALCON signature schemes (https://tprest.github.io/pdf/pub/simple-fast-gaussian.pdf). We will see that the efficiency loss in the resulting implementations is reasonably low compared to the non constant-time.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=729028***8178&autojoin
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
-