A parallel evolutionary approach to solving systems of equations in polycyclic groups

DOI10.1515/gcc-2016-0012zbMath1353.94044OpenAlexW2530883374MaRDI QIDQ338833

Daniel Robertz, Matthew J. Craven

Publication date: 7 November 2016

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

Full work available at URL: http://hdl.handle.net/10026.1/6507

zbMATH Keywords

cryptographypolycyclic groupsparallelevolutionary algorithmshigh performance computingAnshel-Anshel-Goldfeld key agreement protocol

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27) Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

Evolution of group-theoretic cryptology attacks using hyper-heuristics

Uses Software

• GAP
• ParGAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
• Analysis of a certain polycyclic-group-based cryptosystem
• Probabilistic solutions of equations in the braid group.
• Conjugacy problem for braid groups and Garside groups.
• An algebraic method for public-key cryptography
• Efficient collection in infinite polycyclic groups.
• Length-based attacks in polycyclic groups
• Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography
• Random subgroups and analysis of the length-based and quotient attacks
• Length-based cryptanalysis: the case of Thompson's group
• THE BRAID GROUP AND OTHER GROUPS
• Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol

This page was built for publication: A parallel evolutionary approach to solving systems of equations in polycyclic groups