# Key-agreement based on automaton groups

## TL;DR

This paper explores the use of various automaton groups, including Grigorchuk and Basilica groups, as platforms for key-agreement schemes, leveraging their algebraic properties for cryptographic applications.

## Contribution

It introduces novel automaton groups as potential cryptographic platforms for the Anshl-Anshel-Goldfeld metascheme, expanding the scope of automaton groups in cryptography.

## Key findings

- Automaton groups like Grigorchuk and Basilica are viable for key-agreement schemes.
- The groups exhibit properties suitable for cryptographic protocols.
- The subgroup of the affine group has an unsolvable conjugacy problem, enhancing security.

## Abstract

We suggest several automaton groups as key-agreement platforms for Anshl-Anshel-Goldfeld metascheme, they include Grigorchuk and universal Grigorchuk groups, Hanoi 3-Towers group, Basilica group and a subgroup of the affine group with the unsolvable conjugacy problem