On Some Novel Results about Split-Complex Numbers, the Diagonalization Problem, and Applications to Public Key Asymmetric Cryptography

Mehmet Merkepci, Mohammad Abobala and Predrag S. Stanimirović

Journal of Mathematics, 2023, vol. 2023, 1-12

Abstract: In this paper, we present some of the foundational concepts of split-complex number theory such as split-complex divison, gcd, and congruencies. Also, we prove that Euler’s theorem is still true in the case of split-complex integers, and we use this theorem to present a split-complex version of the RSA algorithm which is harder to be broken than the classical version. On the other hand, we study some algebraic properties of split-complex matrices, where we present the formula of computing the exponent of a split-complex matrix eX with a novel algorithm to represent a split-complex matrix X by a split-complex diagonal matrix, which is known as the diagonalization problem. In addition, many examples were illustrated to clarify the validity of our work.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2023/4481016.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2023/4481016.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:4481016

DOI: 10.1155/2023/4481016

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().