Key-agreement based on automaton groups

05/08/2019

∙

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

READ FULL TEXT

Key-agreement based on automaton groups

Measuring intergroup agreement and disagreement

The Group Element of Cybercrime: Types, Dynamics, and Criminal Operations

On the Conjugacy Search Problem in Extraspecial p-Groups

Group Key Agreement in Information Centric Networks with Tree Group Diffie-Hellman

Identifying Competition and Mutualism Between Online Groups

Few-shot Knowledge Transfer for Fine-grained Cartoon Face Generation

Computational Group Selection

Key-agreement based on automaton groups

Related Research

Measuring intergroup agreement and disagreement

The Group Element of Cybercrime: Types, Dynamics, and Criminal Operations

On the Conjugacy Search Problem in Extraspecial p-Groups

Group Key Agreement in Information Centric Networks with Tree Group Diffie-Hellman

Identifying Competition and Mutualism Between Online Groups

Few-shot Knowledge Transfer for Fine-grained Cartoon Face Generation

Computational Group Selection