Quantum cryptanalysis of lightweight block cipher Piccolo

By taking the characteristics of the structure of Piccolo algorithm RP permutation into consideration, a 3-round quantum distinguisher was proposed.Based on Grover meets Simon algorithm, the 6-round of quantum key recovery attack was given.The results show that the key can be recovered 56 bit with t...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiaoni DU, Xiangyu WANG, Lifang LIANG, Kaibin LI
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2023-06-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023109/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:By taking the characteristics of the structure of Piccolo algorithm RP permutation into consideration, a 3-round quantum distinguisher was proposed.Based on Grover meets Simon algorithm, the 6-round of quantum key recovery attack was given.The results show that the key can be recovered 56 bit with the time complexity 2 <sup>28</sup> and the occupation of 464 qubit.Moreover, if attack rounds r>6,the time complexity is 2 <sup>28+16(r-6)</sup>, which is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <mfrac> <mn>1</mn> <mrow> <msup> <mn>2</mn> <mrow> <mn>68</mn></mrow> </msup> </mrow> </mfrac> </math></inline-formula> of Grover quantum brute-force search.The time complexity of the proposed attack method is significantly reduced compared with Grover search and is also better than that of traditional cryptanalysis, which lays a foundation for the subsequent research on quantum attacks of lightweight block ciphers.
ISSN:1000-436X