Key-agreement based on automaton groups
Cryptography and Security
2019-05-09 v1 Computational Complexity
Group Theory
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
Cite
@article{arxiv.1905.03124,
title = {Key-agreement based on automaton groups},
author = {Rostislav Grigorchuk and Dima Grigoriev},
journal= {arXiv preprint arXiv:1905.03124},
year = {2019}
}