Andrzejczak, Michal and Dudzic, Wladyslaw (2019) SAT Attacks on ARX Ciphers with Automated Equations Generation. INFOCOMMUNICATIONS JOURNAL, 11 (4). pp. 2-7. ISSN 2061-2079
|
Text
InfocomJ_2019_4_1_Andrzejczak.pdf Download (807kB) | Preview |
Abstract
We propose a novel and simple approach to algebraic attack on block ciphers with the SAT-solvers. As opposed to a standard approach, the equations for key expansion algorithms are not included in the formulas that are converted to satisfiability problem. The lack of equations leads to finding the solution much faster. The method was used to attack a lightweight block ciphers - SIMON and SPECK. We report the timings for roundreduced versions of selected ciphers and discuss the potential factors affecting the execution time of our attack.
Item Type: | Article |
---|---|
Subjects: | H Social Sciences / társadalomtudományok > HE Transportation and Communications > HE2 Communications / hírközlés Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Depositing User: | Andrea Tankó |
Date Deposited: | 28 Sep 2021 12:33 |
Last Modified: | 28 Sep 2021 12:33 |
URI: | http://real.mtak.hu/id/eprint/131187 |
Actions (login required)
Edit Item |