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: | , |
---|---|
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!
|