论文标题
切割美杜莎的路径 - 通过量子计算处理杀戮链
Cutting Medusa's Path -- Tackling Kill-Chains with Quantum Computing
论文作者
论文摘要
本文着手探索量子脆弱性分析。通过引入与攻击图有关的漏洞图，本文提供了背景理论和随后解决量子计算解决重大网络安全问题的方法。给出的示例是通过用QUBO表达网络上各种漏洞的连通性，然后用量子退火解决此问题来确定补丁。然后证明这样的解决方案可以删除网络上所有杀人链（通往安全妥协的路径）。结果表明，与经典求解时间的指数增加相比，量子计算机的求解时间几乎是恒定的。因此，本文介绍了有利量子脆弱性分析的新例子。
This paper embarks upon exploration of quantum vulnerability analysis. By introducing vulnerability graphs, related to attack graphs, this paper provides background theory and a subsequent method for solving significant cybersecurity problems with quantum computing. The example given is to prioritize patches by expressing the connectivity of various vulnerabilities on a network with a QUBO and then solving this with quantum annealing. Such a solution is then proved to remove all kill-chains (paths to security compromise) on a network. The results demonstrate that the quantum computer's solve time is almost constant compared to the exponential increase in classical solve time for vulnerability graphs of expected real world density. As such, this paper presents a novel example of advantageous quantum vulnerability analysis.
