Key-agreement based on automaton groups

May 08, 2019 Β· Declared Dead Β· πŸ› Groups Complex. Cryptol.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"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 shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted