Key-agreement based on automaton groups

Grigorchuk, Rostislav; Grigoriev, Dima

doi:10.1515/gcc-2019-2012

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Key-agreement based on automaton groups

MPS-Authors

/persons/resource/persons235357

Grigorchuk, Rostislav
Max Planck Institute for Mathematics, Max Planck Society;

External Resource

https://doi.org/10.1515/gcc-2019-2012
(Publisher version)

https://doi.org/10.48550/arXiv.1905.03124
(Preprint)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Grigorchuk, R., & Grigoriev, D. (2019). Key-agreement based on automaton groups. Groups, Complexity, Cryptology, 11(2), 77-81. doi:10.1515/gcc-2019-2012.

Cite as: https://hdl.handle.net/21.11116/0000-0009-DCAD-D

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