Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography

DOI10.1515/gcc-2012-0002zbMath1271.68246OpenAlexW2024506621MaRDI QIDQ2905581

Henri C. Jimbo, Matthew J. Craven

Publication date: 28 August 2012

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2012-0002

zbMATH Keywords

combinatoricssymbolic computationcryptographyevolutionary algorithmspartially commutative grouphybridisation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Braid groups; Artin groups (20F36) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (6)

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem ⋮ A parallel evolutionary approach to solving systems of equations in polycyclic groups ⋮ A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups ⋮ Conjugacy in Baumslag's group, generic case complexity, and division in power circuits ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)

This page was built for publication: Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography