A Comparative Analysis Between RSA and ECC Algorithm

Penumarthy Parvateesam Murthy; Amar Pandey; Dolly Dewangan

doi:doi:10.11648/j.ajam.20261404.12

Research Article |

| Peer-Reviewed

A Comparative Analysis Between RSA and ECC Algorithm

Penumarthy Parvateesam Murthy

, Amar Pandey

, Dolly Dewangan

Published in American Journal of Applied Mathematics (Volume 14, Issue 4)

Received: 8 May 2026 Accepted: 25 May 2026 Published: 9 July 2026

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Cryptography is a fundamental technique for ensuring secure and trustworthy communication between a sender and a receiver by transmitting data in encrypted form. Access to the encrypted data is restricted solely to the legitimate recipient who possesses the appropriate decryption key. It serves a vital function in protecting digital communications and ensuring network security. This paper presents a comparative study of two prominent public-key cryptographic algorithms: RSA (Rivest Shamir Adleman) and ECC (Elliptic Curve Cryptography). In the modern digital landscape, RSA has been the dominant method in public-key encryption systems; however, ECC has gained recognition as a powerful alternative. RSA achieves cryptographic security through the intractability of the Integer Factorization Problem, whereas ECC relies on the computational complexity of the Elliptic Curve Discrete Logarithm Problem. Both mechanisms are widely regarded as effective asymmetric encryption schemes and are extensively applied in data security. The objective of this study is to analyze and compare these approaches to identify strategies that can further strengthen security mechanisms and enhance the protection of sensitive information. Therefore, this RSA versus ECC comparison shows that while RSA enjoys broad adoption, ECC provides enhanced efficiency with minimal key lengths, confirming both serve as indispensable asymmetric encryption methods for constructing resilient, next-generation security architectures defending private data against progressing computational power and novel cybersecurity threats across global digital platforms.

Published in	American Journal of Applied Mathematics (Volume 14, Issue 4)
DOI	10.11648/j.ajam.20261404.12
Page(s)	186-198
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2026. Published by Science Publishing Group

Keywords

Cryptography, Cryptosystem, Rivest-Shamir-Adleman, Elliptic Curve Cryptography, Asymmetric Algorithm, Encryption, Decryption

References

[1]	Adki, V., and Hatkar, S., A survey on cryptography techniques, International Journal of Advanced Research in Computer Science and Software Engineering, 6(6) (2016), 469-475.
[2]	Alese, B. K., and Philemon, E. D., and Falaki, S. O., Comparative analysis of public-key encryption schemes, International Journal of Engineering and Technology Citeseer, 2(9) (2009), 1552-1568.
[3]	Barker, E., Barker, W., Burr, W., Polk, W. and Smid, M., Recommendation for key management part 1: General (revision 3), NIST special publication, 800(57) (2012), 1-147. https://doi.org/10.6028/nist.sp.800-57p1r3
[4]	Bos, J., and Kaihara, M., and Kleinjung, T., and Lenstra, A. K., and Montgomery, P. L., On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography, (2009), http://lacal.epfl.ch/page81774.html
[5]	Durge, P., and Hajare, H. R., Comparative Analysis of RSA and ECC Algorithm, International Research Journal of Engineering and Technology, 7(6) (2020), 2395-0056.
[6]	Gobi, M., and Sridevi, R., and Rahini, R., A comparative study on the performance and the security of RSA and ECC algorithm, International journal of advanced network and application, (2015).
[7]	Gura, N., and Patel, A., and Wander, A., and Eberle, H., and Shantz, S. C., Comparing elliptic curve cryptography and RSA on 8-bit CPUs, in Cryptographic Hardware and Embedded Systems - CHES 2004, ser. Lecture Notes in Computer Science, M. Joye and J. Quisquater, Eds. Springer Berlin Heidelberg, 3156 (2004), 119-132, https://doi.org/10.1007/978-3-540-28632-5_9
[8]	Gura, N., and Patel, A., and Wander, A., and Eberle, H., and Shantz, S. C., Comparing elliptic curve cryptography and RSA on 8-bit CPUs, Cryptographic Hardware and Embedded Systems-CHES 2004: 6th International Workshop Cambridge, MA, USA, August 11-13, 2004. Proceedings 6, Springer, (2004), 119-132. https://doi.org/10.1007/978-3-540-28632-5_9
[9]	Hankerson, D., and Menezes, A. J., and Vanstone, S., Guide to elliptic curve cryptography, Springer Science and Business Media, (2004).
[10]	Jansma, N., and Arrendondo, B., Performance comparison of elliptic curve and rsa digital signatures, nicj. net/files, (2004).
[11]	Kak, A., Lecture notes on computer and network security, Purdue University, (2015). https://doi.org/10.1007/978-3-642-29280-4_1
[12]	Koblitz, N., Elliptic curve cryptosystems, Mathematics of computation, 48(177) (1987), 203-209. https://doi.org/10.1090/s0025-5718-1987-0866109-5
[13]	Kute, V. B., and Paradhi, P. R., and Bamnote, G. R., A software comparison of RSA and ECC, Int. J. Comput. Sci. Appl, 2(1) (2009), 43-59.
[14]	Mahto, D., and Khan, D. A., and Yadav, D. K., Security analysis of elliptic curve cryptography and RSA, Proceedings of the world congress on engineering, 1 (2016), 419-422.
[15]	Mahto, D., and Yadav, D. K., Rsa and ECC: A com-parative analysis, International Journal of Applied Engineering Research, 12(19) (2017), 9053-9061. bibitem {MH} Mallouli, F., and Hellal, A., and Saeed, N. S., and Alzahrani, F. A., A survey on cryptography: comparative study between RSA vs ECC algorithms, and RSA vs El-Gamal algorithms, 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud), IEEE, (2019), 173-176, https://doi.org/10.1109/CSCloud/EdgeCom.2019.00022
[16]	Mallouli, F., and Hellal, A., and Saeed, N. S., and Alzahrani, F. A., A survey on cryptography: comparative study between RSA vs ECC algorithms, and RSA vs El-Gamal algorithms, {\em 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud), IEEE}, (2019), 173--176, https://doi.org/10.1109/CSCloud/EdgeCom.2019.00022
[17]	Maqsood, F., and Ahmed, M., and Ali, M. M., and Shah, M., Cryptography: a comparative analysis for modern techniques, International Journal of Advanced Computer Science and Applications, Science and Information (SAI) Organization Limited, 8(6) (2017), https://doi.org/10.14569/ijacsa.2017.080659
[18]	Miller, V. S., Use of elliptic curves in cryptography, {In Conference on the Theory and Application of Cryptographic Techniques Springer, Berlin, Heidelberg} (1985), 417-426. https://doi.org/10.1007/3-540-39799-x_31
[19]	M. Rafeek Khan et al., Analysis of Elliptic Curve Cryptography & RSA Journal of ICT Standardization, (2023), https://doi.org/10.13052/jicts2245-800X.1142
[20]	M. Sun, Application of Elliptic Curve Cryptography in the Security Field of Resource-constrained Internet of Things, (2025). https://doi.org/10.54254/2753-8818/2025.dl28336
[21]	Raman Kumar, Design and Analysis of various computations using Elliptic Curve Cryptography and RSA, International Journal of Intelligent Systems and Applications in Engineering, (2024), https://doi.org/10.1063/5.0209083
[22]	Rivest, R. L., and Shamir, A., and Adleman, L., A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM New York, NY, USA, 21(2) (1978), 120-126. https://doi.org/10.1145/359340.359342
[23]	Singh, S. R., and Khan, A. K., and Singh, S. R., Performance evaluation of RSA and elliptic curve cryptography, 2nd International Conference on Contemporary Computing and Informatics (IC3I), IEEE, (2016), 302-306. https://doi.org/10.1109/ic3i.2016.7917979
[24]	Stallings, W., Cryptography and Network Security: Principles and Practice, Prentice Hall, Sixth Edition, (1998).
[25]	S. Alshammari et al., Elliptic Curve Cryptography: Applications, challenges, recent advances, and future trends, Computer Science Review, Elsevier, 47, (2023).
[26]	V. N. Sokolov et al., Cryptographic encoding in modern symmetric and asymmetric encryption, Procedia Computer Science, vol. 207 (2022) 54-63, https://doi.org/10.1016/j.procs.2022.09.037

Cite This Article

Plain Text BibTeX RIS

APA Style

Murthy, P. P., Pandey, A., Dewangan, D. (2026). A Comparative Analysis Between RSA and ECC Algorithm. American Journal of Applied Mathematics, 14(4), 186-198. https://doi.org/10.11648/j.ajam.20261404.12

Copy | Download

ACS Style

Murthy, P. P.; Pandey, A.; Dewangan, D. A Comparative Analysis Between RSA and ECC Algorithm. Am. J. Appl. Math. 2026, 14(4), 186-198. doi: 10.11648/j.ajam.20261404.12

Copy | Download

AMA Style

Murthy PP, Pandey A, Dewangan D. A Comparative Analysis Between RSA and ECC Algorithm. Am J Appl Math. 2026;14(4):186-198. doi: 10.11648/j.ajam.20261404.12

Copy | Download

@article{10.11648/j.ajam.20261404.12,
  author = {Penumarthy Parvateesam Murthy and Amar Pandey and Dolly Dewangan},
  title = {A Comparative Analysis Between RSA and ECC Algorithm},
  journal = {American Journal of Applied Mathematics},
  volume = {14},
  number = {4},
  pages = {186-198},
  doi = {10.11648/j.ajam.20261404.12},
  url = {https://doi.org/10.11648/j.ajam.20261404.12},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajam.20261404.12},
  abstract = {Cryptography is a fundamental technique for ensuring secure and trustworthy communication between a sender and a receiver by transmitting data in encrypted form. Access to the encrypted data is restricted solely to the legitimate recipient who possesses the appropriate decryption key. It serves a vital function in protecting digital communications and ensuring network security. This paper presents a comparative study of two prominent public-key cryptographic algorithms: RSA (Rivest Shamir Adleman) and ECC (Elliptic Curve Cryptography). In the modern digital landscape, RSA has been the dominant method in public-key encryption systems; however, ECC has gained recognition as a powerful alternative. RSA achieves cryptographic security through the intractability of the Integer Factorization Problem, whereas ECC relies on the computational complexity of the Elliptic Curve Discrete Logarithm Problem. Both mechanisms are widely regarded as effective asymmetric encryption schemes and are extensively applied in data security. The objective of this study is to analyze and compare these approaches to identify strategies that can further strengthen security mechanisms and enhance the protection of sensitive information. Therefore, this RSA versus ECC comparison shows that while RSA enjoys broad adoption, ECC provides enhanced efficiency with minimal key lengths, confirming both serve as indispensable asymmetric encryption methods for constructing resilient, next-generation security architectures defending private data against progressing computational power and novel cybersecurity threats across global digital platforms.},
 year = {2026}
}

Copy | Download

TY  - JOUR
T1  - A Comparative Analysis Between RSA and ECC Algorithm
AU  - Penumarthy Parvateesam Murthy
AU  - Amar Pandey
AU  - Dolly Dewangan
Y1  - 2026/07/09
PY  - 2026
N1  - https://doi.org/10.11648/j.ajam.20261404.12
DO  - 10.11648/j.ajam.20261404.12
T2  - American Journal of Applied Mathematics
JF  - American Journal of Applied Mathematics
JO  - American Journal of Applied Mathematics
SP  - 186
EP  - 198
PB  - Science Publishing Group
SN  - 2330-006X
UR  - https://doi.org/10.11648/j.ajam.20261404.12
AB  - Cryptography is a fundamental technique for ensuring secure and trustworthy communication between a sender and a receiver by transmitting data in encrypted form. Access to the encrypted data is restricted solely to the legitimate recipient who possesses the appropriate decryption key. It serves a vital function in protecting digital communications and ensuring network security. This paper presents a comparative study of two prominent public-key cryptographic algorithms: RSA (Rivest Shamir Adleman) and ECC (Elliptic Curve Cryptography). In the modern digital landscape, RSA has been the dominant method in public-key encryption systems; however, ECC has gained recognition as a powerful alternative. RSA achieves cryptographic security through the intractability of the Integer Factorization Problem, whereas ECC relies on the computational complexity of the Elliptic Curve Discrete Logarithm Problem. Both mechanisms are widely regarded as effective asymmetric encryption schemes and are extensively applied in data security. The objective of this study is to analyze and compare these approaches to identify strategies that can further strengthen security mechanisms and enhance the protection of sensitive information. Therefore, this RSA versus ECC comparison shows that while RSA enjoys broad adoption, ECC provides enhanced efficiency with minimal key lengths, confirming both serve as indispensable asymmetric encryption methods for constructing resilient, next-generation security architectures defending private data against progressing computational power and novel cybersecurity threats across global digital platforms.
VL  - 14
IS  - 4
ER  -

Copy | Download

Author Information

Penumarthy Parvateesam Murthy

Department of Mathematics, Guru Ghasidas Vishwavidyalaya, Bilaspur, India

Contact Email

http://orcid.org/0000-0003-3745-4607
Amar Pandey

Department of Mathematics, Guru Ghasidas Vishwavidyalaya, Bilaspur, India

Contact Email

http://orcid.org/0009-0004-9355-4076
Dolly Dewangan

Department of Mathematics, Guru Ghasidas Vishwavidyalaya, Bilaspur, India

Contact Email

http://orcid.org/0009-0003-0985-2162

Download PDF

Submit an Article

Sections

Plain Text BibTeX RIS

APA Style

Murthy, P. P., Pandey, A., Dewangan, D. (2026). A Comparative Analysis Between RSA and ECC Algorithm. American Journal of Applied Mathematics, 14(4), 186-198. https://doi.org/10.11648/j.ajam.20261404.12

Copy | Download

ACS Style

Murthy, P. P.; Pandey, A.; Dewangan, D. A Comparative Analysis Between RSA and ECC Algorithm. Am. J. Appl. Math. 2026, 14(4), 186-198. doi: 10.11648/j.ajam.20261404.12

Copy | Download

AMA Style

Murthy PP, Pandey A, Dewangan D. A Comparative Analysis Between RSA and ECC Algorithm. Am J Appl Math. 2026;14(4):186-198. doi: 10.11648/j.ajam.20261404.12

Copy | Download

@article{10.11648/j.ajam.20261404.12,
  author = {Penumarthy Parvateesam Murthy and Amar Pandey and Dolly Dewangan},
  title = {A Comparative Analysis Between RSA and ECC Algorithm},
  journal = {American Journal of Applied Mathematics},
  volume = {14},
  number = {4},
  pages = {186-198},
  doi = {10.11648/j.ajam.20261404.12},
  url = {https://doi.org/10.11648/j.ajam.20261404.12},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajam.20261404.12},
  abstract = {Cryptography is a fundamental technique for ensuring secure and trustworthy communication between a sender and a receiver by transmitting data in encrypted form. Access to the encrypted data is restricted solely to the legitimate recipient who possesses the appropriate decryption key. It serves a vital function in protecting digital communications and ensuring network security. This paper presents a comparative study of two prominent public-key cryptographic algorithms: RSA (Rivest Shamir Adleman) and ECC (Elliptic Curve Cryptography). In the modern digital landscape, RSA has been the dominant method in public-key encryption systems; however, ECC has gained recognition as a powerful alternative. RSA achieves cryptographic security through the intractability of the Integer Factorization Problem, whereas ECC relies on the computational complexity of the Elliptic Curve Discrete Logarithm Problem. Both mechanisms are widely regarded as effective asymmetric encryption schemes and are extensively applied in data security. The objective of this study is to analyze and compare these approaches to identify strategies that can further strengthen security mechanisms and enhance the protection of sensitive information. Therefore, this RSA versus ECC comparison shows that while RSA enjoys broad adoption, ECC provides enhanced efficiency with minimal key lengths, confirming both serve as indispensable asymmetric encryption methods for constructing resilient, next-generation security architectures defending private data against progressing computational power and novel cybersecurity threats across global digital platforms.},
 year = {2026}
}

Copy | Download

TY  - JOUR
T1  - A Comparative Analysis Between RSA and ECC Algorithm
AU  - Penumarthy Parvateesam Murthy
AU  - Amar Pandey
AU  - Dolly Dewangan
Y1  - 2026/07/09
PY  - 2026
N1  - https://doi.org/10.11648/j.ajam.20261404.12
DO  - 10.11648/j.ajam.20261404.12
T2  - American Journal of Applied Mathematics
JF  - American Journal of Applied Mathematics
JO  - American Journal of Applied Mathematics
SP  - 186
EP  - 198
PB  - Science Publishing Group
SN  - 2330-006X
UR  - https://doi.org/10.11648/j.ajam.20261404.12
AB  - Cryptography is a fundamental technique for ensuring secure and trustworthy communication between a sender and a receiver by transmitting data in encrypted form. Access to the encrypted data is restricted solely to the legitimate recipient who possesses the appropriate decryption key. It serves a vital function in protecting digital communications and ensuring network security. This paper presents a comparative study of two prominent public-key cryptographic algorithms: RSA (Rivest Shamir Adleman) and ECC (Elliptic Curve Cryptography). In the modern digital landscape, RSA has been the dominant method in public-key encryption systems; however, ECC has gained recognition as a powerful alternative. RSA achieves cryptographic security through the intractability of the Integer Factorization Problem, whereas ECC relies on the computational complexity of the Elliptic Curve Discrete Logarithm Problem. Both mechanisms are widely regarded as effective asymmetric encryption schemes and are extensively applied in data security. The objective of this study is to analyze and compare these approaches to identify strategies that can further strengthen security mechanisms and enhance the protection of sensitive information. Therefore, this RSA versus ECC comparison shows that while RSA enjoys broad adoption, ECC provides enhanced efficiency with minimal key lengths, confirming both serve as indispensable asymmetric encryption methods for constructing resilient, next-generation security architectures defending private data against progressing computational power and novel cybersecurity threats across global digital platforms.
VL  - 14
IS  - 4
ER  -

Copy | Download