Key agreement based on automaton groups

DOI10.1515/GCC-2019-2012MaRDI QIDQ2178747zbMATH OpenOpenAlexWikidataFDO

Authors R. I. Grigorchuk, Dima Grigoriev

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

affine groupautomaton groupsBasilica groupGrigorchuk groupsHanoi 3-towers groupword and conjugacy problems

Mathematics Subject Classification ID

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

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

Recommendations

• scientific article; zbMATH DE number 2080992
• Non-Abelian key agreement protocols
• Towards provably secure group key agreement building on group theory
• Key agreement schemes based on linear groupoids
• The complexity of Grigorchuk groups with application to cryptography

Cites work

• An algebraic method for public-key cryptography
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Authentication from matrix conjugation
• Automata, dynamical systems, and groups
• Conjugacy problem in a class of \(2\)-groups
• Conjugacy problem in an automorphism group of an infinite tree
• Conjugacy separability of certain torsion groups
• Constructions in public-key cryptography over matrix groups
• Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
• Cryptography and Coding
• DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
• Group-based cryptography
• scientific article; zbMATH DE number 2156384 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1836316 (Why is no real title available?)
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• Orbit decidability and the conjugacy problem for some extensions of groups.
• Public key exchange using semidirect product of (semi)groups
• Schreier spectrum of the Hanoi Towers group on three pegs
• Solved and unsolved problems around one group.
• The complexity of Grigorchuk groups with application to cryptography
• The conjugacy problem for certain branch groups
• The conjugacy problem in automaton groups is not solvable.
• The conjugacy problem in the Grigorchuk group is polynomial time decidable.
• The word problem in Hanoi Towers groups.
• Universal groups of intermediate growth and their invariant random subgroups

Cited in

(2)

• Liftable self-similar groups and scale groups
• Burnside groups and groups acting on rooted trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178747)