We examine Anshel–Anshel–Goldfeld key exchange protocol with a generalized Heisenberg group, H_m, as a platform. We show that subgroup restricted simultaneous conjugacy search problem in H_m can be solved in quasiquintic time, which allows the computation of the private keys of the parties.
(Published in DeGruyter Groups Complexity Cryptology May 2016. Coauthored with Dr. Andrey Nikolaev of Stevens Institute of Technology.)
Kenneth Blaney hasn't uploaded this paper.
Let Kenneth know you want this paper to be uploaded.
