Asymmetric Cryptosystem on Matrix Algebra over a Chain Ring

The revolutionary idea of asymmetric cryptography brings a fundamental change to our modern communication system. However, advances in quantum computers endanger the security of many asymmetric cryptosystems based on the hardness of factoring and discrete logarithm, while the complexity of the quantum algorithm makes it hard to implement in many applications. In this respect, novel asymmetric cryptosystems based on matrices over residue rings are in practice. In this article, a novel approach is introduced. Despite the matrix algebra M(k,Z_n), the matrix algebra M (k, R′ₙ), R′ₙ  =  (Z₂[w])/(wⁿ-1) as the chain ring is considered. In this technique, instead of exponentiation, the inner product automorphisms the use for key generation. The chain ring provides computational complexity to its algorithm, which improves the strength of the cryptosystem. However, the residue ring endangers the security of the original cryptosystem, while it is hard to break using R′ₙ . The structure of the chain ring deals with the binary field Z₂, which simplifies its calculation and makes it capable of efficient execution in various application. 

Other Information

Published in: Symmetry
License: https://creativecommons.org/licenses/by/4.0/
See article on publisher's website: http://dx.doi.org/10.3390/sym13010045