Key-agreement based on automaton groups
classification
💻 cs.CR
cs.CCmath.GR
keywords
groupgroupsautomatongrigorchukkey-agreementaffineanshl-anshel-goldfeldbasilica
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.