Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
Open Access
- 2 June 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Cybersecurity
- Vol. 4 (1), 1-14
- https://doi.org/10.1186/s42400-021-00081-x
Abstract
In this paper, we greatly increase the number of impossible differentials for SIMON and SIMECK by eliminating the 1-bit constraint in input/output difference, which is the precondition to ameliorate the complexity of attacks. We propose an algorithm which can greatly reduce the searching complexity to find such trails efficiently since the search space exponentially expands to find impossible differentials with multiple active bits. There is another situation leading to the contradiction in impossible differentials except for miss-in-the-middle. We show how the contradiction happens and conclude the precondition of it defined as miss-from-the-middle. It makes our results more comprehensive by applying these two approach simultaneously. This paper gives for the first time impossible differential characteristics with multiple active bits for SIMON and SIMECK, leading to a great increase in the number. The results can be verified not only by covering the state-of-art, but also by the MILP model.Keywords
This publication has 30 references indexed in Scilit:
- The SIMON and SPECK lightweight block ciphersPublished by Association for Computing Machinery (ACM) ,2015
- Cryptanalysis of Reduced-Round SIMON32 and SIMON48Published by Springer Science and Business Media LLC ,2014
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block CiphersLecture Notes in Computer Science, 2014
- Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and SimonPublished by Springer Science and Business Media LLC ,2014
- The PHOTON Family of Lightweight Hash FunctionsLecture Notes in Computer Science, 2011
- A Cryptanalysis of PRINTcipher: The Invariant Subspace AttackLecture Notes in Computer Science, 2011
- spongent: A Lightweight Hash FunctionLecture Notes in Computer Science, 2011
- PRESENT: An Ultra-Lightweight Block CipherLecture Notes in Computer Science, 2007
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible DifferentialsLecture Notes in Computer Science, 1999
- Truncated and higher order differentialsLecture Notes in Computer Science, 1995