A SAT-based approach for index calculus on binary elliptic curves (original) (raw)

Paper 2019/313

A SAT-based approach for index calculus on binary elliptic curves

Monika Trimoska, Sorina Ionica, and Gilles Dequen

Abstract

Logical cryptanalysis, first introduced by Massacci in 2000, is a viable alternative to common algebraic cryptanalysis techniques over boolean fields. With XOR operations being at the core of many cryptographic problems, recent research in this area has focused on handling XOR clauses efficiently. In this paper, we investigate solving the point decomposition step of the index calculus method for prime degree extension fields mathbbF2n\mathbb{F}_{2^n}mathbbF2n, using SAT solving methods. We experimented with different SAT solvers and decided on using WDSat, a solver dedicated to this specific problem. We extend this solver by adding a novel breaking symmetry technique and optimizing the time complexity of the point decomposition step by a factor of m!m!m! for the (m+1)(m+1)(m+1)\textsuperscript{th} Semaev's summation polynomial. While asymptotically solving the point decomposition problem with this method has exponential worst time complexity in the dimension lll of the vector space defining the factor base, experimental running times show that the the presented SAT solving technique is significantly faster than current algebraic methods based on Gröbner basis computation. For the values lll and nnn considered in the experiments, the WDSat solver coupled with our breaking symmetry technique is up to 300 times faster then MAGMA's F4 implementation, and this factor grows with lll and nnn.

BibTeX

@misc{cryptoeprint:2019/313, author = {Monika Trimoska and Sorina Ionica and Gilles Dequen}, title = {A {SAT}-based approach for index calculus on binary elliptic curves}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/313}, year = {2019}, doi = {10.1007/978-3-030-51938-4_11}, url = {https://eprint.iacr.org/2019/313} }