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...
Saved in:
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!
|
Similar Items
-
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
by: Zhao Dongming, et al.
Published: (2021) -
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
by: Xavier Sánchez-Díaz, et al.
Published: (2021) -
Journal of mathematical cryptology
Published: (2007) -
Systematic and Critical Review of RSA Based Public Key Cryptographic Schemes: Past and Present Status
by: Raza Imam, et al.
Published: (2021) -
Groups, complexity, cryptology
Published: (2009)