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

Lize Gu | Zendy; Shihui Zheng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Lize Gu,

Shihui Zheng

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/630607

Subject(s) - factorization , integer factorization , cryptography , conjugacy class , encryption , mathematics , integer (computer science) , algebraic structure , algebraic number , theoretical computer science , algebra over a field , computer science , discrete mathematics , algorithm , pure mathematics , public key cryptography , computer security , programming language , mathematical analysis

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research