EconPapers    
Economics at your fingertips  
 

Quantum Chosen-Cipher Attack on Camellia

Yanjun Li (), Qi Wang, Dingyun Huang, Jian Liu and Huiqin Xie
Additional contact information
Yanjun Li: Infomation Industry lnformation Security Evaluation Center, The 15th Research Institute of China Electronics Technology Group Corporation, Beijing 100083, China
Qi Wang: Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China
Dingyun Huang: Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China
Jian Liu: Infomation Industry lnformation Security Evaluation Center, The 15th Research Institute of China Electronics Technology Group Corporation, Beijing 100083, China
Huiqin Xie: Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China

Mathematics, 2025, vol. 13, issue 9, 1-18

Abstract: The Feistel structure represents a fundamental architectural component within the domain of symmetric cryptographic algorithms, with a substantial body of research conducted within the context of classical computing environments. Nevertheless, research into specific symmetric cryptographic algorithms utilizing the Feistel structure is relatively scarce in quantum computing environments. This paper, for the first time, proposes a five-round distinguisher for Camellia under the quantum chosen-ciphertext attack (qCCA) setting, with its effectiveness empirically validated. Additionally, by combining Grover’s algorithm and Simon’s algorithm, we construct a nine-round key-recovery attack model against Camellia. Through an in-depth analysis of Camellia’s key expansion algorithm, we significantly reduce the complexity of the key-recovery attack. The proposed attack achieves a time complexity of 2 61.5 for recovering the correct key bits and requires 531 quantum bits.

Keywords: Feistel cipher; quantum chosen-ciphertext attacks; Grover’s algorithm; Simon’s algorithm; Camellia (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/9/1383/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/9/1383/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:9:p:1383-:d:1641148

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-05-10
Handle: RePEc:gam:jmathe:v:13:y:2025:i:9:p:1383-:d:1641148