计算机科学
密码分析
密码系统
算法
量子算法
分组密码
利用
背景(考古学)
量子计算机
钥匙(锁)
S盒
叠加原理
量子
理论计算机科学
密码学
数学
计算机安全
物理
量子力学
古生物学
数学分析
生物
作者
Bao-Min Zhou,Zheng Yuan
标识
DOI:10.1109/ccpqt60491.2023.00017
摘要
Block cryptanalysis has a major breakthrough in the model of superposition queries. For instance, Simon’s algorithm can efficiently break various constructions. In practice, Bernstein-Vaziran’s algorithm can also realize the periodic search of the vector function. Moreover, in some cases, it can have more advantages than the Simon’s algorithm.In the context of this study, we present an algorithm that combines Grover’s and Bernstein-Vazirani’s quantum algorithms. This algorithm empowers us to carry out key recovery attacks on Feistel structures. on Feistel structures, FX construction and Even Mansour construction. We exploit cryptosystems’ algebraic structure to launch successful key recovery attacks, considering that quantum attackers can only make classical queries. Through comparison, it can be concluded that this algorithm has stronger practicability in attacking block ciphers.
科研通智能强力驱动
Strongly Powered by AbleSci AI