论文标题
量子退火在加密中的应用
Applications of Quantum Annealing in Cryptography
论文作者
论文摘要
本文提出了一种新方法，将伪树状功能优化为QUBO问题，该方法可以通过量子退火器解决。新方法有两个方面，一个是系数优化，另一个是可变优化。在特殊情况下，前者是对现有算法的改进。后者是通过图理论中的最大独立点来实现的。我们将这种新方法应用于量子退火器上的整数分解，并以93个变量实现最大的整数分解（4137131），系数范围为[-1024,1024]，比以前的结果小得多。我们还专注于对块密码的量子攻击，并提出一种有效的方法，该方法具有较小的系数，以将布尔方程式系统转换为QUBO问题。
This paper presents a new method to reduce the optimization of a pseudo-Boolean function to QUBO problem which can be solved by quantum annealer. The new method has two aspects, one is coefficient optimization and the other is variable optimization. The former is an improvement on the existing algorithm in a special case. The latter is realized by means of the maximal independent point set in graph theory. We apply this new method in integer factorization on quantum annealers and achieve the largest integer factorization (4137131) with 93 variables, the range of coefficients is [-1024,1024] which is much smaller than the previous results. We also focus on the quantum attacks on block ciphers and present an efficient method with smaller coefficients to transform Boolean equation systems into QUBO problems.
