New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems

DOI10.1007/978-3-642-21518-6_1zbMath1295.94148OpenAlexW1451279014MaRDI QIDQ3019912

Jun Shao, Eiji Okamoto, Li-hua Wang, Zhen Fu Cao, Li-Cheng Wang

Publication date: 29 July 2011

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21518-6_1

zbMATH Keywords

braid groupspublic-key encryptionconjugacy search problemstruncated multivariable polynomials over rings

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Linear decomposition method in analyzing hidden information protocols on algebraic platforms ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) ⋮ Two general schemes of algebraic cryptography ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography

This page was built for publication: New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems