Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers

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 co...

Full description

Bibliographic Details
Main Authors: Xuzi Wang, Baofeng Wu, Lin Hou, Dongdai Lin
Format: Article
Language:English
Published: SpringerOpen 2021-06-01
Series:Cybersecurity
Subjects:
Online Access:https://doi.org/10.1186/s42400-021-00081-x
id doaj-c217de0f7e764bb9bd0fe49674f6c332
record_format Article
spelling doaj-c217de0f7e764bb9bd0fe49674f6c3322021-06-06T11:03:42ZengSpringerOpenCybersecurity2523-32462021-06-014111410.1186/s42400-021-00081-xSearching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphersXuzi Wang0Baofeng Wu1Lin Hou2Dongdai Lin3State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of SciencesState Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of SciencesState Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of SciencesState Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of SciencesAbstract 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.https://doi.org/10.1186/s42400-021-00081-xImpossible differential characteristicsImpossible subspace trailsMiss-from-the-middleSIMONSIMECK
collection DOAJ
language English
format Article
sources DOAJ
author Xuzi Wang
Baofeng Wu
Lin Hou
Dongdai Lin
spellingShingle Xuzi Wang
Baofeng Wu
Lin Hou
Dongdai Lin
Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
Cybersecurity
Impossible differential characteristics
Impossible subspace trails
Miss-from-the-middle
SIMON
SIMECK
author_facet Xuzi Wang
Baofeng Wu
Lin Hou
Dongdai Lin
author_sort Xuzi Wang
title Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
title_short Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
title_full Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
title_fullStr Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
title_full_unstemmed Searching for impossible subspace trails and improved impossible differential characteristics for SIMON-like block ciphers
title_sort searching for impossible subspace trails and improved impossible differential characteristics for simon-like block ciphers
publisher SpringerOpen
series Cybersecurity
issn 2523-3246
publishDate 2021-06-01
description 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.
topic Impossible differential characteristics
Impossible subspace trails
Miss-from-the-middle
SIMON
SIMECK
url https://doi.org/10.1186/s42400-021-00081-x
work_keys_str_mv AT xuziwang searchingforimpossiblesubspacetrailsandimprovedimpossibledifferentialcharacteristicsforsimonlikeblockciphers
AT baofengwu searchingforimpossiblesubspacetrailsandimprovedimpossibledifferentialcharacteristicsforsimonlikeblockciphers
AT linhou searchingforimpossiblesubspacetrailsandimprovedimpossibledifferentialcharacteristicsforsimonlikeblockciphers
AT dongdailin searchingforimpossiblesubspacetrailsandimprovedimpossibledifferentialcharacteristicsforsimonlikeblockciphers
_version_ 1721394449596022784