The Unseen Engine of Trust A Deep Dive into the RSA Algorithm

Article Sidebar

Main Article Content

Dr Partha Majumdar

This analysis offers a thorough overview of the RSA algorithm, a key element of modern digital security that addresses the historic challenge of secure communication over insecure public channels. Its innovation is based on number theory, using a "trapdoor" one-way function reliant on the significant computational difference between multiplying large prime numbers and factoring their product. Paired with modular arithmetic and Euler's Totient Theorem, this enables the practical use of public-key cryptography, where a public key encrypts data that only the matching private key can decrypt. The text highlights RSA's vital role in internet security, especially in securing web connections via SSL/TLS and ensuring authenticity and integrity with digital signatures. It discusses the cybersecurity arms race, stressing the importance of sufficient key lengths and secure practices to fend off classical attacks. The analysis also examines RSA's main vulnerability: the threat from quantum computing. Shor's algorithm can efficiently solve the integer factorisation problem, making RSA obsolete and prompting a global shift to Post-Quantum Cryptography (PQC). Despite its eventual replacement, RSA's legacy as the first framework that enabled trust in the digital world remains a monumental achievement in computer science.

The Unseen Engine of Trust A Deep Dive into the RSA Algorithm. (2026). International Journal of Latest Technology in Engineering Management & Applied Science, 14(12), 942-953. https://doi.org/10.51583/IJLTEMAS.2025.1412000084

Downloads

References

Durai Raj Vincent, P. M. (2016, June 1). RSA encryption algorithm - A survey on its various forms and its security level. ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/306215546_RSA_encryption_algorithm_A_survey_on_its_various_forms_and_its_security_level

Galbraith, S. (2025, December 1). Post-Quantum Cryptography. ResearchGate. Retrieved December 21, 2025, from https://www.researchgate.net/publication/398244591_Post-Quantum_Cryptography

Grover, L. K. (1996, June 1). Fast quantum mechanical algorithm for database search. ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/2201607_Fast_quantum_mechanical_algorithm_for_database_search

Ireland, K., & Rosen, M. (1990). A Classical Introduction to Modern Number Theory (2nd ed.). Springer-Verlag New York Inc.

Jain, B., & Mittal, H. K. (2025, May 1). Post-Quantum Cryptography: A Comprehensive Review of Past Technologies and Current Advances. ResearchGate. Retrieved December 21, 2025, from https://www.researchgate.net/publication/392329453_Post-Quantum_Cryptography_A_Comprehensive_Review_of_Past_Technologies_and_Current_Advances

Kulandei, B., & Dhenakaran, S. S. (2017, October 1). An Overview of Cryptanalysis of RSA Public key System. ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/321031748_An_Overview_of_Cryptanalysis_of_RSA_Public_key_System

Lenstra, A. K., & Lenstra, H. W. (1993). The Development of the Number Field Sieve. Springer. Retrieved December 21, 2025, from https://link.springer.com/book/10.1007/BFb0091534

Luo, Z. J., Liu, R., Mehta, A., & Ali, M. L. (n.d.). Demystifying the RSA Algorithm: An Intuitive Introduction for Novices in Cybersecurity. Arxiv. Retrieved December 21, 2025, from https://arxiv.org/html/2308.02785v2

Mahto, D., & Yadav, D. K. (2017, January 1). RSA and ECC: A comparative analysis. ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/322558426_RSA_and_ECC_A_comparative_analysis

Olutola, A., & Matthew, O. (2023, January 1). Comparative Analysis of Encryption Algorithms. ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/366889851_Comparative_Analysis_of_Encryption_Algorithms

Paul, J. (2025, July 1). USE OF DES, AES, AND RSA IN SECURE COMMUNICATION PROTOCOLS (SSL/TLS, VPN, ETC.). ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/393976056_USE_OF_DES_AES_AND_RSA_IN_SECURE_COMMUNICATION_PROTOCOLS_SSLTLS_VPN_ETC

PITE, J., ZHONG, Y., & ZHU, H. (1977). THE RSA CRYPTOSYSTEM. Massachusetts Institute of Technology. Retrieved December 21, 2025, from

https://math.mit.edu/research/highschool/primes/circle/documents/2024/Honglin.pdf

Rivest, R., Shamir, A., & Adelman, L. (2021, February 1). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978). ResearchGate. Retrieved December 21, 2025, from https://www.researchgate.net/publication/349073609_A_Method_for_Obtaining_Digital_Signatures_and_Public-Key_Cryptosystems_1978

Shor, P. W. (2006, June 1). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. ResearchGate. Retrieved December 21, 2025, from https://www.researchgate.net/publication/280821144_Polynomial-Time_Algorithms_for_Prime_Factorization_and_Discrete_Logarithms_on_a_Quantum_Computer

Trappe, W., & Washington, L. C. (2006). Introduction to Cryptography with Coding Theory (2nd ed.). Prentice Hall.

Van Meter, R., & Itoh, K. M. (2004, September 1). Fast Quantum Modular Exponentiation. ResearchGate. Retrieved December 21, 2025, from

https://www.researchgate.net/publication/2193429_Fast_Quantum_Modular_Exponentiation

Article Details

How to Cite

The Unseen Engine of Trust A Deep Dive into the RSA Algorithm. (2026). International Journal of Latest Technology in Engineering Management & Applied Science, 14(12), 942-953. https://doi.org/10.51583/IJLTEMAS.2025.1412000084