Description
The use of SAT solvers is enjoying a boom in the area of cryptanalysis. In this presentation we explore the reasons for the efficiency of SAT solvers in this field. The presentation will describe how SAT solvers' variable branching heuristics, conflict analysis routines and lazy data structures work in unison to create a complex algorithm that can tackle difficult problems with relative ease. During the presentation, we give examples to highlight the advantages and disadvantages of each component of the final algorithm.
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
-