Groups -- Complexity -- Cryptology 01 (2009), No. 2, 217--225
Copyright Heldermann Verlag 2009
Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem
Delaram Kahrobaei
Mathematics Department, New York City College of Technology, 300 Jay Street, Brooklyn, NY 11201, U.S.A.
dkahrobaei@gc.cuny.edu
Michael Anshel
Dept. of Computer Science, City College of New York, 138th Street and Convent Ave, New York, NY 10031, U.S.A.
csmma@cs.ccny.cuny.edu
A method for non-abelian Cramer-Shoup cryptosystem is presented. The role of decision and search is explored, and the platform of solvable/polycyclic group is suggested. In the process we review recent progress in non-abelian cryptography and post some open problems that naturally arise from this path of research.
[ Fulltext-pdf (101 KB)] for subscribers only.