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...
Enregistré dans:
Auteurs principaux: | Craven Matthew J., Woodward John R. |
---|---|
Format: | article |
Langue: | EN |
Publié: |
De Gruyter
2021
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/92fdbd5fd096448b8aee398e7b8132e7 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
par: Zhao Dongming, et autres
Publié: (2021) -
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
par: Xavier Sánchez-Díaz, et autres
Publié: (2021) -
Journal of mathematical cryptology
Publié: (2007) -
Systematic and Critical Review of RSA Based Public Key Cryptographic Schemes: Past and Present Status
par: Raza Imam, et autres
Publié: (2021) -
Groups, complexity, cryptology
Publié: (2009)