A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
Group Theory
2014-10-21 v3 Computational Complexity
Cryptography and Security
Abstract
In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups whose conjugacy problem is at least as hard as the subset sum problem with indeterminates. As such, the conjugacy problem over the groups is NP-complete where the parameters of the problem are taken in terms of and the length of the elements given on input.
Keywords
Cite
@article{arxiv.1403.4153,
title = {A family of polycyclic groups over which the uniform conjugacy problem is NP-complete},
author = {Bren Cavallo and Delaram Kahrobaei},
journal= {arXiv preprint arXiv:1403.4153},
year = {2014}
}