SMT-based cube attack on round-reduced Simeck32/64

Document Type

Article

Publication Date

9-1-2020

Abstract

In this study, the authors take advantage of feeding the SMT solver by extra information provided through middle state cube characteristics to introduce a new method which they call SMT-based cube attack, and apply it to improve the success of the solver in attacking reduced-round versions of Simeck32/64 lightweight block cipher. The key idea is to search for and utilise all found middle state characteristics of a cube at one round of attack. They first propose a new algorithm to find cubes with most number of middle state characteristics. Then, they apply these obtained cubes and their characteristics as extra information in the SMT definition of the cryptanalysis problem, to evaluate its effectiveness. Their cryptanalysis results in a full key recovery attack by 64 plaintext/ciphertext pairs on 12 rounds of the cipher in just 122.17 s. This is the first algebraic attack so far presented against the reduced-round versions of Simeck32/64, and also with practical complexities. They also conduct the cube attack on the Simeck32/64 to compare with the SMT-based cube attack. The results indicate that the proposed attack is more powerful than the cube attack.

Identifier

85090091541 (Scopus)

Publication Title

Iet Information Security

External Full Text Location

https://doi.org/10.1049/iet-ifs.2019.0496

e-ISSN

17518717

ISSN

17518709

First Page

604

Last Page

611

Issue

5

Volume

14

This document is currently not available here.

Share

COinS