Decision and search in non-abelian Cramer-Shoup public key cryptosystem

DOI10.1515/GCC.2009.217MaRDI QIDQ5189803zbMATH OpenFDO

Authors Delaram Kahrobaei, Michael Anshel

Publication date 11 March 2010

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.4519

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: 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.

Recommendations

• A public key cryptosystem based on non-abelian finite groups
• scientific article; zbMATH DE number 1842507
• An analysis of some key distribution public systems based on non-abelian groups
• Aspects of nonabelian group based cryptography: a survey and open problems
• scientific article; zbMATH DE number 2135342

Cites work

• Cryptosystems using linear groups
• Homomorphic public-key cryptosystems and encrypting Boolean circuits
• On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
• Solvable groups with polynomial Dehn functions
• The algorithmic theory of polycyclic-by-finite groups
• The word problem

Cited in

(6)

• The power conjugacy problem in Higman-Thompson groups.
• A family of polycyclic groups over which the uniform conjugacy problem is NP-complete.
• A nonlinear decomposition attack
• Solving the conjugacy decision problem via machine learning
• Cryptanalysis of Cramer-Shoup like cryptosystems based on index exchangeable family
• The group factorization problem in finite groups of Lie type

This page was built for publication: Decision and search in non-abelian Cramer-Shoup public key cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189803)