We propose an algorithm that enables secure information and communication channel based on perfect end-to-end key-exchange scheme. The secure channel between two users enables each user to use the public key of the other user to derive a specific private key for both users. In a review of previous work, we have shown that traditional (but yet widely used) security algorithm such as those that use public key encryption are not perfect-secure; the public key encryption (known as N, or the Modules’ Arithmetic Number) makes these schemes to be broken under many kinds of attacks. Unlike these schemes, our approach is not based on the computational assumptions like: Integer Factorization (as for RSA); and Discrete Logarithm Problem (as for Diffie-Hellman). In addition, our approach improved the process to prevent the man-in-the-middle attack which is a crucial problem that remains unsolved.

key exchange, private encryption, public encryption, integer factorization problem, man in the middle attach, perfect scheme.

Received: February 8, 2023; Accepted: March 20, 2023; Published: April 11, 2023

How to cite this article: Khaldoun Besoul, Qassim AL Mahmoud and Ayman Alhalaybeh, Information theoretically secure key exchange algorithm, Advances and Applications in Discrete Mathematics 38(1) (2023), 111-125. http://dx.doi.org/10.17654/0974165823023

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] R. L. Rivest, A. Shamir and L. Adleman, method for obtaining digital signatures and public key crypto systems, Commun. ACM, 21(2) (1978), 120-126.
[2] W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory 22(6) (1976), 644-654.
[3] J. Buchmann, F. Göpfert, T. Güneysu, T. Oder and T. Pöppelmann, High-performance and Lightweight Lattice Based Public-Key Encryption, Proc. 2nd ACM Int. Work. IoT Privacy, Trust. Secur. - IoTPTS’ 16 (2016), pp. 2-9.
[4] H. B. Pethe and S. R. Pande, Comparative study and analysis of cryptographic algorithms, International Journal of Advance Research in Computer Science and Management Studies 5(1) (2017), 48-56.
[5] G. C. Kessler, An Overview of Cryptography, Boca Raton: Auerbach Publications, 2017.
[6] N. Priya and M. Kannan, Comparative study of RSA and probabilistic encryption, International Journal of Engineering and Computer Science 6(1) (2017), 19867-19871.
[7] Nordrum, Tech-Talk: IEEE Spectrum, IEEE Spectrum, 3 March 2016. [Online]. Available:
http://spectrum.ieee.org/tech-talk/computing/hardware/encryptionbusting-quantum-computer-practices-factoring-in-scalable-fiveatom-experiment [Accessed 19 March 2017].
[8] B. Steyn, Essays: Doctrina.org, Doctrina.org, 26 May 2012. [Online]. Available: http://doctrina.org/How-RSA-Works-With-Examples.html [Accessed 19 March 2017].
[9] E. Frenkel, Articles: Slate.com, Slate.com, 3 June 2013. [Online]. Available: http://www.slate.com/articles/health_and_science/science/2013/06/online_credit_card_security_the_rsa_algorithm_prime_numbers_and_pierre_fermat.html [Accessed 20 March 2017].
[10] M. Rouse, Network Security: Search security.Techtarget.com, November 2014. [Online]. Available: http://searchsecurity.techtarget.com/definition/RSA [Accessed 19 March 2017].
[11] S. D. Schoen, www.loyalty.org, Loyalty.org, [Online]. Available: http://www.loyalty.org/~schoen/rsa/ [Accessed 22 March 2017].
[12] Information Technology Laboratory, Digital Signature Standard (DSS), National Institute of Standards and Technology, Gaithersburg, 2013.
[13] L. Van Thai, McEliece cryptosystem-based identification and signature scheme using chained BCH codes, (2015), 122-127.