Abstract
We examine the Anshel-Anshel-Goldfeld key exchange protocol with a generalized Heisenberg group, Hm, as a platform. We show that subgroup-restricted simultaneous conjugacy search problem in Hm can be solved in quasi-quintic time, which allows the computation of the private keys of the parties.
| Original language | English |
|---|---|
| Pages (from-to) | 69-74 |
| Number of pages | 6 |
| Journal | Groups, Complexity, Cryptology |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 May 2016 |
Keywords
- Anshel-Anshel-Goldfeld protocol
- conjugacy problem
- generalized Heisenberg group
- key establishment
Fingerprint
Dive into the research topics of 'A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver