Show simple item record

dc.contributor.authorCraven, MJ
dc.contributor.authorWoodward, JR
dc.date.accessioned2021-10-29T10:26:17Z
dc.date.available2021-10-29T10:26:17Z
dc.date.issued2021-10-26
dc.identifier.issn1862-2976
dc.identifier.issn1862-2984
dc.identifier.other1
dc.identifier.urihttp://hdl.handle.net/10026.1/18190
dc.description.abstract

<jats:title>Abstract</jats:title> <jats:p>In previous work, we developed a <jats:italic>single</jats:italic> 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, simple heuristics), with 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 that out perform the existing EA. The new algorithms solve a greater number of random AAG instances than the EA. This suggests the approach may 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 article is thus a framework to automatically build algorithms to attack cryptology problems given an applicable group.</jats:p>

dc.format.extent49-63
dc.languageen
dc.language.isoen
dc.publisherWalter de Gruyter GmbH
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rightsAttribution 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectevolutionary algorithms
dc.subjectpolycyclic groups
dc.subjectcryptography
dc.subjectAnshel-Anshel-Goldfeld key exchange protocol
dc.subjecthyper-heuristic
dc.subjectmachine learning
dc.titleEvolution of group-theoretic cryptology attacks using hyper-heuristics
dc.typejournal-article
dc.typeArticle
plymouth.issue1
plymouth.volume16
plymouth.publisher-urlhttp://dx.doi.org/10.1515/jmc-2021-0017
plymouth.publication-statusPublished
plymouth.journalJournal of Mathematical Cryptology
dc.identifier.doi10.1515/jmc-2021-0017
plymouth.organisational-group/Plymouth
plymouth.organisational-group/Plymouth/Faculty of Science and Engineering
plymouth.organisational-group/Plymouth/REF 2021 Researchers by UoA
plymouth.organisational-group/Plymouth/REF 2021 Researchers by UoA/EXTENDED UoA 10 - Mathematical Sciences
plymouth.organisational-group/Plymouth/REF 2021 Researchers by UoA/UoA10 Mathematical Sciences
plymouth.organisational-group/Plymouth/Users by role
plymouth.organisational-group/Plymouth/Users by role/Academics
dcterms.dateAccepted2021-09-28
dc.rights.embargodate2021-10-30
dc.identifier.eissn1862-2984
dc.rights.embargoperiodNot known
rioxxterms.versionofrecord10.1515/jmc-2021-0017
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by/4.0/
rioxxterms.licenseref.startdate2021-10-26
rioxxterms.typeJournal Article/Review


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International
Except where otherwise noted, this item's license is described as Attribution 4.0 International

All items in PEARL are protected by copyright law.
Author manuscripts deposited to comply with open access mandates are made available in accordance with publisher policies. Please cite only the published version using the details provided on the item record or document. In the absence of an open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author.
Theme by 
Atmire NV