Key-agreement based on automaton groups

This work addresses the need for secure communication in cryptography by introducing new group-based platforms, though it appears incremental as it applies an existing metascheme to different groups.

The authors tackled the problem of secure key-agreement by proposing automaton groups, such as Grigorchuk and Hanoi 3-Towers groups, as platforms for the Anshl-Anshel-Goldfeld metascheme, resulting in a method leveraging groups with unsolvable conjugacy problems for cryptographic applications.