In this paper, we design a new version of the RSA public key cryptosystem which utilizes the octonion polynomials that are elements of an octonion algebra with eight-dimensions. In the proposed version, which is called OP-RSA cryptosystem, the keys are created as the octonion polynomials. The plaintext is chosen as an octonion polynomial and the ciphertext for it is an element in an octonion algebra (OA) which is an octonion polynomial as well. The decryption process is proved mathematically based on the octonion polynomials. The security issues are determined. The proposed OP-RSA cryptosystem is more secure in comparison with other presented versions.
7 September 2025 in Iraqi Journal of Communications and Computer Networks
The reliability theory has many applications in different areas, in mathematics, engineering, manufacturing the devices, computer scinace and cryptography as well . A reliable cryptosystem: type RSA has been proposed in 2 dimension. The plaintext M has been divided into two parts m1 and m2 in the proposed reliable RSA cryptosystem (R-RSA). Sub-ciphertexts (C1, C2) and (C1’, C2’) form two paths which are corresponding to the parts m1 and m2 respectively. The encrypted plaintext is designed as a reliable system which considers a new main point in this work. The encryption and decryption processes on the proposed R-RSA cryptosystem are done uses the path tracing method (PTM) and parallel series reduction method (PSRM). A study case of the R-RSA cryptosystem is discussed as a new experimental result. The security issues on R-RSA cryptosystem are determined. A more secure R-RSA cryptosystem has been designed for communication in compare to other previous cryptosystems.
Graph theory as an essential area of mathematics for several applications. It uses for modeling many real life problems in various specializations, in engineering , computer science, banking, industry, transportation, as well as in cryptography and security to solve them. In this work, alternative symmetric encryption (SE) scheme are proposed based on new formula of shared secret key (SSK). This key is generated using the coloring star graph (CSG). The ciphertext of the plaintext, that is an English word or English sentence, is computed and sent in the channel as the CSG. The attackers here with the proposed SE scheme facing the difficulty to recover the secret key. New experimental result is presented with small parameters as a study case. So, the security of the proposed CSG-SE scheme depending on how to generate the secret key. Thus, the CSG-SE scheme considers as more secure SE scheme in compare with previous ones for communication.