2021
DOI: 10.1049/ise2.12044
|View full text |Cite
|
Sign up to set email alerts
|

Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC

Abstract: Lesamnta-LW-BC is the internal block cipher of the Lesamnta-LW lightweight hash function, specified in ISO/IEC 29192-5:2016. It is based on the unbalanced Feistel network and Advanced Encryption Standard round function. In this study, the security of Lesamnta-LW-BC against integral and impossible-differential attacks is evaluated. Specifically, the authors searched for the integral distinguishers and impossible differentials with Mixed-Integer Linear Programming-based methods. As a result, the discovered impos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 18 publications
(51 reference statements)
0
8
0
Order By: Relevance
“…Since it contains more impossible differentials than that in Ref. [19], it is more suitable to attack Lesamnta‐LW‐BC. By exploiting this 21‐round truncated impossible differential, 27‐round impossible differential attack on Lesamnta‐LW‐BC will be mounted.…”
Section: Impossible Differential Attack On Reduced‐round Lesamnta‐lw‐bcmentioning
confidence: 99%
See 4 more Smart Citations
“…Since it contains more impossible differentials than that in Ref. [19], it is more suitable to attack Lesamnta‐LW‐BC. By exploiting this 21‐round truncated impossible differential, 27‐round impossible differential attack on Lesamnta‐LW‐BC will be mounted.…”
Section: Impossible Differential Attack On Reduced‐round Lesamnta‐lw‐bcmentioning
confidence: 99%
“…In addition, compared with the previous distinguisher whose α = ( a 0 , 0, 0, 0, 0, 0, 0, 0) and β = ( b 0 , 0, 0, 0, 0, 0, 0, 0) in Ref. [19], the input differences of ours are the same, while the output differences β = ( b 0 , b 1 , b 2 , b 3 , 0, 0, 0, 0) can be any non‐zero 32‐bit word for the first 4 bytes instead of being restricted to the first byte. Obviously, our truncated distinguisher contains more impossible differentials than before.…”
Section: Impossible Differential Attack On Reduced‐round Lesamnta‐lw‐bcmentioning
confidence: 99%
See 3 more Smart Citations