An analytic study of a novel algebraic public key encryption scheme based on polynomials over noncommutative matrix ring.

Different public key exchange protocols can be employed to design a cryptosystem. The most famous example is the ElGamal cryptosystem which is based on the Diffie–Hellman key establishment to do encryption and decryption. In the same fashion, we propose a public key cryptosystem using a public key exchange protocol. This variant uses the polynomials over noncommutative matrix ring as underlying work structure. The useful feature of the proposed cryptosystem is that it provides favorable security because of use of the generalized decomposition problem over the noncommutative ring of matrices. The issues regarding the choice of parameters and platform are discussed. Further, a brief note on security analysis of the proposed cryptosystem is also presented. [ABSTRACT FROM AUTHOR]