Improved BV-based quantum attack on block ciphers

Sun, Hong-Wei; Wei, Chun-Yan; Cai, Binbin; Qin, Su‐Juan; Wen, Qiaoyan; Gao, Fei

doi:10.1007/s11128-022-03752-x

Cited by 8 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [35], Xie and Yang proposed quantum related-key attacks on iterated Even-Mansour cipher using the Bernstein-Vazirani (BV) algorithm [36]. Subsequently, Sun et al [37] improved a BV-based quantum attack, applying it to related-key attacks on iterated Even-Mansour and Feistel ciphers with independent round keys. In addition to, in INDOCRYPT 2020, Cid et al [30] showed quantum distinguishing and key-recovery attacks on contracting Feistel-KF structures with Simon's algorithm can be extended to related-key attacks in quantum superposition.…”

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

“…Later, Malviya et al concluded several latest quantum cryptanalysis techniques including qRKA for attacking symmetric cryptography [21]. In 2023, Sun et al introduced an improved BV-based algorithm to realize a quadratic speedup and presented qRKAs on iterated Even-Mansour ciphers and i-round Feistel ciphers with independent round keys [35].…”

Section: Introductionmentioning

confidence: 99%

Quantum Related-Key Attack Based on Simon’s Algorithm and Its Applications

Zhang

2023

Symmetry

View full text Add to dashboard Cite

With the development of quantum technology, quantum computing has an increasingly significant impact on cryptanalysis. Several quantum algorithms, such as Simon’s algorithm, Grover’s algorithm, the Bernstein–Vazirani algorithm, Shor’s algorithm, and the Grover-meets-Simon algorithm, have been proposed successively. However, almost all cryptanalysis is based on the quantum chosen-plaintext attack (qCPA) model. This paper focuses on a powerful cryptanalytic model, quantum related-key attack (qRKA), and proposes a strategy of qRKAs against symmetric ciphers using Simon’s algorithm. We construct a periodic function to efficiently recover the secret key of symmetric ciphers if the attacked symmetric ciphers satisfy Simon’s promise, and present the complexity analysis on specific symmetric ciphers. Then, we apply qRKA to the Even–Mansour cipher and SoEM construction, recover their secret keys, and show their complexity comparison in the distinct attack models. This work is of great significance for the qRKA cryptanalysis of existing provably secure cryptographic schemes and the design of future quantum secure cryptographic schemes.

show abstract

“…This started with the 3-round Feistel distinguisher proposed by Kuwakado and Morii. [16] After that, more generic constructions, such as Even-Mansour cipher, [17,18] FX construction, [19] message authentication codes (MACs), [20][21][22][23] etc, [24][25][26] were broken by different quantum algorithms, including Simon algorithm, [27] Grover algorithm, [28] Grover-meets-Simon algorithm, [19] Bernstein-Vazirani (BV) algorithm, [29] etc.…”

Section: Introduction 1quantum Attacks Against Symmetric Crypto Primi...mentioning

confidence: 99%

Quantum Attacks on Type‐1 Generalized Feistel Schemes

et al. 2023

Self Cite

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

Improved BV-based quantum attack on block ciphers

Cited by 8 publications

References 34 publications

Quantum Cryptanalysis on Feistel Variants in Related-Key Settings

Quantum Cryptanalysis on Feistel Variants in Related-Key Settings

Quantum Related-Key Attack Based on Simon’s Algorithm and Its Applications

Quantum Attacks on Type‐1 Generalized Feistel Schemes

Contact Info

Product

Resources

About