English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Key-agreement based on automaton groups

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

Item is

Files

show Files
hide Files
:
arXiv:1905.03124.pdf (Preprint), 120KB
Name:
arXiv:1905.03124.pdf
Description:
File downloaded from arXiv at 2022-01-27 09:57
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show
hide
Locator:
https://doi.org/10.1515/gcc-2019-2012 (Publisher version)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Grigorchuk, Rostislav1, Author           
Grigoriev, Dima, Author
Affiliations:
1Max Planck Institute for Mathematics, Max Planck Society, ou_3029201              

Content

show
hide
Free keywords: Computer Science, Cryptography and Security, Computational Complexity, Group Theory
 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

Details

show
hide
Language(s): eng - English
 Dates: 2019
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: arXiv: 1905.03124
DOI: 10.1515/gcc-2019-2012
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Groups, Complexity, Cryptology
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: de Gruyter
Pages: - Volume / Issue: 11 (2) Sequence Number: - Start / End Page: 77 - 81 Identifier: -