Key agreement based on automaton groups

DOI10.1515/gcc-2019-2012zbMath1435.20043arXiv1905.03124OpenAlexW2981363327WikidataQ126979150 ScholiaQ126979150MaRDI QIDQ2178747

Dima Yu. Grigoriev, Rostislav I. Grigorchuk

Publication date: 11 May 2020

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.03124

zbMATH Keywords

automaton groupsaffine groupGrigorchuk groupsBasilica groupword and conjugacy problemsHanoi 3-towers group

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• The conjugacy problem in the Grigorchuk group is polynomial time decidable.
• Universal groups of intermediate growth and their invariant random subgroups
• Group-based cryptography
• The complexity of Grigorchuk groups with application to cryptography
• Conjugacy problem in a class of \(2\)-groups
• Conjugacy problem in an automorphism group of an infinite tree
• Conjugacy separability of certain torsion groups
• An algebraic method for public-key cryptography
• The conjugacy problem in automaton groups is not solvable.
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Public Key Exchange Using Semidirect Product of (Semi)Groups
• Schreier spectrum of the Hanoi Towers group on three pegs
• Orbit decidability and the conjugacy problem for some extensions of groups
• Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
• DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• The word problem in Hanoi Towers groups
• Authentication from Matrix Conjugation
• Cryptography and Coding

This page was built for publication: Key agreement based on automaton groups