Communication Dans Un Congrès Année : 2025

ANF-Based Satisfiability for Weil-Descent Cryptographic Attacks

Résumé

In recent years, SAT solvers have been increasingly used in cryptanalysis, for performing attacks both on symmetric and asymmetric schemes. More specifically, they are employed whenever one needs to compute a valid assignment for a logical formula when running the attack. Most often, these formulae are initially represented in Algebraic Normal Form (ANF). Solvers dedicated to solving such instances translate the input formulae into a conjunction of CNF and XOR clauses and use different techniques such as XOR recovery and manipulation and Gaussian elimination. In this paper, we aim to build a solver able to reason directly on ANF formulae derived from attacks using Weil descent on Semaev polynomials of elliptic curves, while integrating dedicated lazy structures inspired from SAT solvers.

Fichier principal
Vignette du fichier
CODIT2025_article.pdf (339.22 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05176414 , version 1 (22-07-2025)

Licence

Identifiants

Citer

Anthony Blomme, Sami Cherif, Sorina Ionica, Gilles Dequen. ANF-Based Satisfiability for Weil-Descent Cryptographic Attacks. 11th-2025 International Conference on Control, Decision and Information Technologies (CoDIT), Jul 2025, Split - Croatia, Croatia. pp.906-911, ⟨10.1109/CoDIT66093.2025.11321693⟩. ⟨hal-05176414⟩
370 Consultations
246 Téléchargements

Altmetric

Partager

  • More