Computational Complexity of Group Theoretic Problems in Polycyclic Groups

Problem's Description

The complexity of algorithmic problems of group theoretic problems has been of great importance after many new applications in cryptography. Polycyclic Groups are the most successful one among others. In the reference there are several problems proposed for cryptography. However the complexity of some of them is still an open question.

1. Article The status of polycyclic group-based cryptography: A survey and open problems

   • Jonathan Gryak,
   • Delaram Kahrobaei

   Groups Complexity Cryptology 8 (2), 171-186, 2016arXiv