Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem

DOI10.1515/GCC.2009.217zbMath1191.94092arXiv1309.4519MaRDI QIDQ5189803

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)

Related Items (4)

A nonlinear decomposition attack ⋮ The power conjugacy problem in Higman–Thompson groups ⋮ Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family ⋮ A family of polycyclic groups over which the uniform conjugacy problem is NP-complete

Cites Work

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

This page was built for publication: Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem