arXiv · 1905.03124
Key-agreement based on automaton groups
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
Explore related subjects
Keep this discovery
Rostislav Grigorchuk, Dima Grigoriev. 2019-05-08. Key-agreement based on automaton groups. https://arxiv.org/abs/1905.03124
Cite the original work for its findings. Save a collection to share your selection of sources.