Full Length Article
DOI: https://doi.org/10.54216/IJNS.250201
On Two Novel Generalized Versions of Diffie-Hellman Key Exchange Algorithm Based on Neutrosophic and Split-Complex Integers and their Complexity Analysis
The objective of this paper is to build the Split-Complex version of Diffie-Hellman key Exchange Algorithm, where we use the mathematical foundations of Split-Complex Number Theory and Integers, such as congruencies, raising a split-complex integer to a power of split-complex integer to build novel algorithms for key Exchange depending of famous Diffie-Hellman algorithm. Additionally, we present the proposed version of the Diffie-Hellman algorithm based on neutrosophic number theory. Also, we analyze the complexity of the novel algorithms with many examples that explain their applied validity.
Dima Alrwashdeh,
Talat Alkhouli,
Ahmed Soiman Rashed Alhawiti
et al.
visibility
2579
download
4591