A public key cryptosystem using matrix over the finite ring
The paper introduces a public-key cryptosystem based on structured matrix operations over the finite ring.\N\[\N\mathbb{Z}/2^{64}\mathbb{Z}.\N\]\NThe proposed scheme uses a public matrix and several auxiliary public parameters, while the trapdoor information consists of structured matrices and vectors, allowing efficient decryption. The authors give a detailed construction of the key-generation procedure, the encryption map, and the corresponding decryption algorithm.\N\NThe main mathematical contribution of the paper is the explicit design of a trapdoor transformation whose inversion, in the absence of the secret key, is presented as a system of nonlinear equations over a finite ring. The authors also provide a correctness proof showing that decryption recovers the original plaintext block. This proof is the strongest part of the paper: it carefully tracks the relations among the matrices and auxiliary parameters and shows that the decryption procedure reconstructs the intermediate vector needed to invert the encryption process.\N\NFrom a cryptographic perspective, the work should be viewed as a proposed construction rather than as a fully established secure public-key encryption scheme. The security discussion is based on the asserted difficulty of solving the induced nonlinear system over a finite ring. However, no formal security notion such as one-wayness, IND-CPA security, or IND-CCA security is defined, and no reduction to a standard hard problem is given. Moreover, the paper explicitly leaves the cryptanalysis of the proposed system to forthcoming work.\N\NThis point is important because matrix-based and multivariate public-key constructions often contain exploitable algebraic structure. In the present scheme, the ring\N\[\N\mathbb{Z}/2^{64}\mathbb{Z}\N\]\Nhas substantial 2-adic structure, and an attacker may attempt reductions modulo \(2\), \(2^8\), or other powers of two. The use of public structured matrices, low-dimensional nonlinear auxiliary variables, and deterministic encryption also suggests several natural directions for further cryptanalysis.\N\NThe implementation results reported by the authors indicate linear scaling in the tested message sizes and approximately \(20\%\) ciphertext expansion. These experiments support the functional feasibility of the implementation, but they do not by themselves establish cryptographic security.\N\NOverall, the paper gives a detailed algebraic proposal for a matrix-based public-key cryptosystem over a finite ring and proves its correctness. Its security, however, remains an open question pending further cryptanalytic analysis. The work may be of interest to readers studying experimental matrix-based or multivariate approaches to public-key cryptography, especially over non-field rings, but its use as a practical cryptographic primitive would require substantially stronger security evidence.
- A new public key cryptography using \(M_q\) matrix
- A novel approach with matrix based public key crypto systems
- Concerning certain linear transformation apparatus of cryptography.
- Cryptography in an algebraic alphabet.
- Matrix Lie group as an algebraic structure for NTRU like cryptosystem
- Simple matrix scheme for encryption
- SimpleMatrix -- a multivariate public key cryptosystem (MPKC) for encryption
- Statistical zero knowledge and quantum one-way functions
- Trapdoor memory-hard functions
This page was built for publication: A public key cryptosystem using matrix over the finite ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227717)
