Evolution of group-theoretic cryptology attacks using hyper-heuristics

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 h...

Full description

Saved in:
Bibliographic Details
Main Authors: Craven Matthew J., Woodward John R.
Format: article
Language:EN
Published: De Gruyter 2021
Subjects:
Online Access:https://doaj.org/article/92fdbd5fd096448b8aee398e7b8132e7
Tags: Add Tag
No Tags, Be the first to tag this record!