Key-agreement based on automaton groups
May 08, 2019 Β· Declared Dead Β· π Groups Complex. Cryptol.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Rostislav Grigorchuk, Dima Grigoriev
arXiv ID
1905.03124
Category
cs.CR: Cryptography & Security
Cross-listed
cs.CC,
math.GR
Citations
6
Venue
Groups Complex. Cryptol.
Last Checked
4 months ago
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
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Cryptography & Security
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
The Limitations of Deep Learning in Adversarial Settings
R.I.P.
π»
Ghosted
Distillation as a Defense to Adversarial Perturbations against Deep Neural Networks
R.I.P.
π»
Ghosted
Spectre Attacks: Exploiting Speculative Execution
R.I.P.
π»
Ghosted
How To Backdoor Federated Learning
R.I.P.
π»
Ghosted
Evasion Attacks against Machine Learning at Test Time
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted