Author:
Gryak Jonathan,Kahrobaei Delaram
Abstract
AbstractPolycyclic 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 [
Funder
National Science Foundation
Office of Naval Research
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference88 articles.
1. The conjugacy search problem in public key cryptography: Unnecessary and insufficient;Appl. Algebra Engrg. Comm. Comput.,2006
2. Nis05-6: A non-commutative generalization of ElGamal key exchange using polycyclic groups;IEEE Global Telecommunications Conference,2006
3. The automorphism group of a polycyclic group;Ann. of Math. (2),1969
4. On the orbit-stabilizer problem for integral matrix actions of polycyclic groups;Math. Comp.,2003
5. Using the subgroup membership search problem in public key cryptography;Algebraic Methods in Cryptography,2006
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献