Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.08458

Evolution of Group-Theoretic Cryptology Attacks using Hyper-heuristics

Matthew J. Craven·John R. Woodward
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.GRcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew J. Craven, John R. Woodward. 2020-06-15. Evolution of Group-Theoretic Cryptology Attacks using Hyper-heuristics. https://doi.org/10.1515/jmc-2021-0017

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Haagerup property for groups and for tracial von Neumann algebras in terms of invariant and mixing states

The aim of the article is to provide two characterizations of the Haagerup property: one for locally compact, second countable groups, and the other one for finite von Neumann algebras. Both are expressed in terms of approximations of some non-ergodic invariant states by mixing ones for actions on unital $C^*$-algebras on the one hand, and for pairs of tracial von Neumann algebras by mixing binormal states on the other hand.

math.GR↗
arXiv2026

The McCullough-Miller complex for right angled Artin groups

McCullough and Miller constructed a contractible complex on which the pure symmetric automorphism group of a free group acts with free abelian stabilizers. This complex has been used for computations such as the cohomological dimension of these groups, their cohomology rings, and results about $\ell^2$-Betti numbers or BNRS-invariants. We generalize this construction to pure symmetric automorphism groups of arbitrary RAAGs and exhibit applications of this generalization.

math.GR↗
arXiv2026

The quantitative non-unique-product landscape at the global minimum: the Nielsen-Soelberg groups

Nielsen and Soelberg proved that a finite subset $A$ of a torsion-free group with $A\cdot A$ having no unique product satisfies $|A|\ge 8$, and exhibited two groups, here $G_1$ and $G_2$, attaining the bound. Nothing quantitative was known about these extremal configurations. We construct exact, independently verified models of both groups and compute the first quantitative invariants at the global minimum. In $G_1$ no $8$-element symmetric witness lies in the radius-$6$ ball ($933$ elements, certified infeasible), while the Nielsen-Soelberg witness lies in the radius-$7$ ball: the global minimum is spread out. In $G_2$, with its natural eight-generator metric, the witness and its inverse are the only two non-UP $8$-sets in the radius-$1$ ball, and the unique-product staircase takes the value $0$ at $n=8$ but $1$ at $n=9$ -- the first known minimizer whose square has exactly one uniquely represented element, so the simultaneous failure of t.u.p. and u.p. seen in the Promislow group is not universal. No $(7,9)$ two-sided witness exists in the searched balls, so the Nielsen-Soelberg profile bound may not be sharp. Finally we treat the universal group $G_3$. Its structure is known -- Soelberg's thesis identifies an index-$8$ Heisenberg subgroup of step $8$ and proves torsion-freeness, and Gardam, studying the same group as an amalgam of Klein bottle groups, shows it to be virtually nilpotent but not virtually abelian -- and what we add is a model in search coordinates in which balls can be enumerated. In it we reproduce the Nielsen-Soelberg two-sided pair and exhibit a symmetric $15$-element witness whose trivial-coset singleton generates the centre of that Heisenberg subgroup. It is rigid and rare: within $B(5)$ the size $15$ is exactly minimal, the coset profile is forced, and exactly four such witnesses exist in $B(4)$, one orbit. Hence $m_1(G_3)\in[8,15]$ against $m_2(G_3)=16$.

math.GR↗