Authors : James HAKIZIMANA; Dr. Wilson MUSONI; Dr. Emmanuel BUGINGO

Volume/Issue : Volume 9 - 2024, Issue 5 - May

Google Scholar : https://tinyurl.com/2tspr5nf

Scribd : https://tinyurl.com/4jzac43h

DOI : https://doi.org/10.38124/ijisrt/IJISRT24MAY675

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

Abstract : This paper presents an algorithm for performing encryption and decryption using modular exponentiation mainly based on Euler’s Theorem. The algorithm uses the properties of modular arithmetic to ensure secure communication. The gcd function is employed to find coprime numbers within a given range, which are then utilized as bases for encryption and decryption. The modular Exponentiation function efficiently computes the exponentiation of a base to a power modulo a given modulus. Through a step-by-step process, the algorithm encrypts a numerical message using the selected base and then decrypts it, ensuring the original message is recovered accurately. Experimental results demonstrate the effectiveness and reliability of the algorithm for secure data transmission. In the conclusion we discussed the effectiveness of the algorithm compared to the existing ones such as Elgamal algorithm and RSA Cryptography. The algorithm presented in this paper publishes only the modulus (integer) number and protocols of key exchanges kept secret between sender and receiver; therefore, the algorithm is not fully asymmetric but semi symmetric.

Keywords : RSA, ECC, GCD.

References :

1. A. Buchmann, J., Introduction to cryptography, New York: Springer-Verlag, 2001.
2. A. Anderson, J., Number theory with application, Carolina at Sparta: University of South: Upper saddle river, 1997.
3. U. Dudley, Elementary Number Theory, New Yolk: W. H. FREEMAN AND COMPANY , May 1978 .
4. Bart Goddard, Kenneth H. rosen, Elementary Number Theory and its applications, Bosston: Pearson Education, Inc, 2005. a