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 impo...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-03-01
|
| Series: | IET Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ise2.12044 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850225771458592768 |
|---|---|
| author | Rentaro Shiba Kosei Sakamoto Fukang Liu Kazuhiko Minematsu Takanori Isobe |
| author_facet | Rentaro Shiba Kosei Sakamoto Fukang Liu Kazuhiko Minematsu Takanori Isobe |
| author_sort | Rentaro Shiba |
| collection | DOAJ |
| description | 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 impossible differential can reach up to 21 rounds, while three integral distinguishers reaching 18, 19 and 25 rounds are obtained, respectively. Moreover, it is also feasible to construct a 47‐round integral distinguisher in the known‐key setting. Finally, a 20‐round key‐recovery attack is proposed based on the discovered 18‐round integral distinguisher and a 19‐round key‐recovery attack using a 17‐round impossible differential. To the best of the authors' knowledge, this is the first third‐party cryptanalysis of Lesamnta‐LW‐BC. |
| format | Article |
| id | doaj-art-51bb4a8a12ea4bd69562fff72a18651b |
| institution | OA Journals |
| issn | 1751-8709 1751-8717 |
| language | English |
| publishDate | 2022-03-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-51bb4a8a12ea4bd69562fff72a18651b2025-08-20T02:05:16ZengWileyIET Information Security1751-87091751-87172022-03-01162758510.1049/ise2.12044Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BCRentaro Shiba0Kosei Sakamoto1Fukang Liu2Kazuhiko Minematsu3Takanori Isobe4Graduate School of Applied Informatics University of Hyogo Kobe JapanGraduate School of Applied Informatics University of Hyogo Kobe JapanGraduate School of Applied Informatics University of Hyogo Kobe JapanNEC Corporation Kawasaki JapanGraduate School of Applied Informatics University of Hyogo Kobe JapanAbstract 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 impossible differential can reach up to 21 rounds, while three integral distinguishers reaching 18, 19 and 25 rounds are obtained, respectively. Moreover, it is also feasible to construct a 47‐round integral distinguisher in the known‐key setting. Finally, a 20‐round key‐recovery attack is proposed based on the discovered 18‐round integral distinguisher and a 19‐round key‐recovery attack using a 17‐round impossible differential. To the best of the authors' knowledge, this is the first third‐party cryptanalysis of Lesamnta‐LW‐BC.https://doi.org/10.1049/ise2.12044integer programminglinear programming |
| spellingShingle | Rentaro Shiba Kosei Sakamoto Fukang Liu Kazuhiko Minematsu Takanori Isobe Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC IET Information Security integer programming linear programming |
| title | Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC |
| title_full | Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC |
| title_fullStr | Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC |
| title_full_unstemmed | Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC |
| title_short | Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC |
| title_sort | integral and impossible differential attacks on the reduced round lesamnta lw bc |
| topic | integer programming linear programming |
| url | https://doi.org/10.1049/ise2.12044 |
| work_keys_str_mv | AT rentaroshiba integralandimpossibledifferentialattacksonthereducedroundlesamntalwbc AT koseisakamoto integralandimpossibledifferentialattacksonthereducedroundlesamntalwbc AT fukangliu integralandimpossibledifferentialattacksonthereducedroundlesamntalwbc AT kazuhikominematsu integralandimpossibledifferentialattacksonthereducedroundlesamntalwbc AT takanoriisobe integralandimpossibledifferentialattacksonthereducedroundlesamntalwbc |