Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography

Abstract EN

To resist known quantum algorithm attacks, several nonabelian algebraic structures mounted upon the stage of modern cryptography.

Recently, Baba et al.

proposed an important analogy from the integer factorization problem to the factorization problem over nonabelian groups.

In this paper, we propose several conjugated problems related to the factorization problem over nonabelian groups and then present three constructions of cryptographic primitives based on these newly introduced conjugacy systems: encryption, signature, and signcryption.

Sample implementations of our proposal as well as the related performance analysis are also presented.