Quantum Attacks on Type-3 Generalized Feistel Scheme and Unbalanced Feistel Scheme with Expanding Functions

Zhang, Zhongya; Wu, Wenling; Sui, Han; Wang, Bolin

doi:10.23919/cje.2021.00.294

Cited by 5 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Soon after, Ni et al improved quantum distinguishers for Type-1 generalized Feistel structures in [26]. Besides, quantum distinguishers for Type-3 generalized Feistel structures [27,28] are proposed. The security of the SM4like and MARS-like structures under quantum distinguishing attacks is discussed in [15,18,29,30], that is, quantum distinguishers for the SM4-like and MARS-like structures are given.…”

Section: Introductionmentioning

confidence: 99%

Quantum Cryptanalysis on Feistel Variants in Related-Key Settings

Wang,

Chen,

Xiang

et al. 2024

Preprint

View full text Add to dashboard Cite

Simon’s algorithm is a well-known quantum algorithm that can achieve exponential acceleration. This paper studies the applications of Simon’s algorithm in analyzing the security of Feistel variants, several well-known cryptographic structures derived from the Feistel structure. Specifically, we study quantum related-key attacks on Feistel variants in the setting that adversaries can only control part of the key difference in quantum superposition. We delve into observing the quantum related-key attacks on the balanced Feistel structure given by Cid \textit{et al.} and slightly improve the existing method to design periodic functions, ultimately providing a new approach to building periodic functions in single-key settings. Based on these results, we propose a general technique to construct quantum related-key distinguishers exploiting the quantum single-key distinguishers construction technique. As applications of our proposed technique, we demonstrate how to construct new polynomial-time quantum related-key chosen-plaintext distinguishers on several Feistel variants: Feistel-KF, SM4-like, MARS-like, Type-1/2/3 generalized Feistel-KF structures.

show abstract

Section: Introductionmentioning

confidence: 99%

Quantum Cryptanalysis on Feistel Variants in Related-Key Settings

Wang,

Chen,

Xiang

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

Quantum Attacks on Type‐1 Generalized Feistel Schemes

et al. 2023

View full text Add to dashboard Cite

Generalized Feistel schemes (GFSs) are extremely important and extensively researched cryptographic schemes. In this paper, the security of Type‐1 GFS in quantum circumstances is investigated. On the one hand, in the qCCA setting, a new quantum polynomial‐time distinguisher on ‐round Type‐1 GFS with branches is given, which extends the previous results by rounds. This leads to a more efficient analysis of type‐1 GFS, that is, the complexity of some previous key‐recovery attacks is reduced by a factor of , where k is the key length of the internal round function. On the other hand, for CAST‐256, which is a certain block cipher based on Type‐1 GFS, a 17‐round quantum distinguisher in the qCPA setting is given. Based on this, an ‐round quantum key‐recovery attack with complexity is constructed.

show abstract