Skip to Main content Skip to Navigation
Theses

Combinatorics in algebraic and logical cryptanalysis

Abstract : In this thesis, we explore the use of combinatorial techniques, such as graph-based algorithms and constraint satisfaction, in cryptanalysis. Our main focus is on the elliptic curve discrete logarithm problem. First, we tackle this problem in the case of elliptic curves defined over prime-degree binary extension fields, using the index calculus attack. A crucial step of this attack is solving the point decomposition problem, which consists in finding zeros of Semaev’s summation polynomials and can be reduced to the problem of solving a multivariate Boolean polynomial system. To this end, we encode the point decomposition problem as a logical formula and define it as an instance of the SAT problem. Then, we propose an original XOR-reasoning SAT solver, named WDSat, dedicated to this specific problem. As Semaev’s polynomials are symmetric, we extend the WDSat solver by adding a novel symmetry breaking technique that, in contrast to other symmetry breaking techniques, is not applied to the modelization or the choice of a factor base, but to the solving process. Experimental running times show that our SAT-based solving approach is significantly faster than current algebraic methods based on Gröbner basis computation. In addition, our solver outperforms other state-of-the-art SAT solvers, for this specific problem. Finally, we study the elliptic curve discrete logarithm problem in the general case. More specifically, we propose a new data structure for the Parallel Collision Search attack proposed by van Oorschot and Wiener, which has significant consequences on the memory and time complexity of this algorithm
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-03624620
Contributor : ABES STAR :  Contact
Submitted on : Wednesday, March 30, 2022 - 1:54:08 PM
Last modification on : Thursday, May 5, 2022 - 3:02:11 AM

File

TheseTrimoska.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-03624620, version 1

Collections

Citation

Monika Trimoska. Combinatorics in algebraic and logical cryptanalysis. Other [cs.OH]. Université de Picardie Jules Verne, 2021. English. ⟨NNT : 2021AMIE0005⟩. ⟨tel-03624620⟩

Share

Metrics

Record views

133

Files downloads

177