论文标题
使用超高术的群体理论加密攻击的演变
Evolution of Group-Theoretic Cryptology Attacks using Hyper-heuristics
论文作者
论文摘要
在先前的工作中，我们开发了一种单个进化算法（EA），以求解多环类对Anshel-Anshel-Goldfeld（AAG）密钥交换协议的随机实例。 EA由六个操纵字符串的简单启发式方法组成。目前的工作通过首次探索在群体理论隐秘中使用超高术的使用来扩展这一点。超高术是一种从现有算法组件（在这种情况下是简单的启发式方法）中生成新算法的一种方式，其EAS是我们超女性框架可以生成的算法类型的一个例子。我们将上述EA作为起点，并通过对其进行小型调整来允许超高术在它上建立。这种适应性是通过将EA和注入基于简单启发式方法构建的启发式链的过程。我们证明我们可以创建新颖的启发式链，当将其放置在EA中时，会创建算法，使现有的EA表现出色。与更难的实例相比，新算法比EA明显求解了随机AAG实例。这表明该方法可以应用于许多相同类型的问题，从而为解决方案的解决方案提供了一个框架。因此，本文的贡献是自动构建算法以攻击密码学问题的框架。
In previous work, we developed a single Evolutionary Algorithm (EA) to solve random instances of the Anshel-Anshel-Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings. The present work extends this by exploring the use of hyper-heuristics in group-theoretic cryptology for the first time. Hyper-heuristics are a way to generate new algorithms from existing algorithm components (in this case the simple heuristics), with the EAs being one example of the type of algorithm which can be generated by our hyper-heuristic framework. We take as a starting point the above EA and allow hyper-heuristics to build on it by making small tweaks to it. This adaptation is through a process of taking the EA and injecting chains of heuristics built from the simple heuristics. We demonstrate we can create novel heuristic chains, which when placed in the EA create algorithms which out-perform the existing EA. The new algorithms solve a markedly greater number of random AAG instances than the EA for harder instances. This suggests the approach could be applied to many of the same kinds of problems, providing a framework for the solution of cryptology problems over groups. The contribution of this paper is thus a framework to automatically build algorithms to attack cryptology problems.
