Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Key agreement based on automaton groups

Key agreement based on automaton groups AbstractWe suggest several automaton groups as platforms for Anshel–Anshel–Goldfeld key agreement metascheme.They include Grigorchuk and universal Grigorchuk groups, Hanoi 3-towers group, the Basilica group and a subgroup of the affine group Aff4⁢(ℤ){\mathrm{Aff}_{4}(\mathbb{Z})}. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Key agreement based on automaton groups

Loading next page...
 
/lp/de-gruyter/key-agreement-based-on-automaton-groups-zGDDcwm33v
Publisher
de Gruyter
Copyright
© 2019 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2019-2012
Publisher site
See Article on Publisher Site

Abstract

AbstractWe suggest several automaton groups as platforms for Anshel–Anshel–Goldfeld key agreement metascheme.They include Grigorchuk and universal Grigorchuk groups, Hanoi 3-towers group, the Basilica group and a subgroup of the affine group Aff4⁢(ℤ){\mathrm{Aff}_{4}(\mathbb{Z})}.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2019

There are no references for this article.