hide
Free keywords:
Computer Science, Cryptography and Security, 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