The status of polycyclic group-based cryptography: A survey and open problems
Abstract
Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups. Moreover, the non-virtually nilpotent ones exhibit an exponential growth rate. These properties make them suitable for use in group-based cryptography, which was proposed in 2004 by Eick and Kahrobaei [
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Jan 01, 2016
- Source ID
- 10.1515/gcc-2016-0013
Entities
People
- Delaram Kahrobaei
- Jonathan Gryak
Organizations
- National Science Foundation
- Office of Naval Research