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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Craven Matthew J., Woodward John R.
Formato: article
Lenguaje:EN
Publicado: De Gruyter 2021
Materias:
Acceso en línea:https://doaj.org/article/92fdbd5fd096448b8aee398e7b8132e7
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!