Download pdf
A comparative analysis of public key cryptographic algorithms: RSA, ELGamal, and elliptic curve encryption
- 1 University College London
* Author to whom correspondence should be addressed.
Abstract
Cryptography stands as an indispensable and efficient facet within the expansive field of information security. It offers a reliable method for ensuring the confidentiality and integrity of data during the complex process of information transmission between a sender and a recipient. Beyond this, exclusive decryption privileges are meticulously reserved for the designated recipient. This individual holds the exclusive authority to decipher the transmitted information, which has been encrypted by the key holder beforehand. This scholarly investigation introduces and delves into three prevalent cryptographic algorithms: RSA, El-Gamal, and Elliptic Curve Cryptography. It offers a discerning examination and contrast of the underlying mathematical challenges associated with each sophisticated method. The discourse unfolds a detailed comparative analysis of these three pivotal algorithms, zeroing in on their crucial aspects such as key size length and operational running time. The in-depth exploration within this study aims to shed light on the intricate workings, strengths, and potential limitations of RSA, El-Gamal, and Elliptic Curve Cryptography. By unraveling these aspects, the study contributes to a richer understanding and more informed choices in the practical application of cryptographic algorithms, enhancing the overarching realm of information security in an increasingly digital and interconnected world.
Keywords
RSA, ElGamal, ECC
[1]. Ferguson, N., Schneier, B., & Kohno, T. (2011). Cryptography engineering: design principles and practical applications. John Wiley & Sons.
[2]. Goyal, S. (2012). A Survey on the Applications of Cryptography. International Journal of Science and Technology, 1(3).
[3]. Diffie, W., & Hellman, M. E. (2022). New directions in cryptography. In Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman (pp. 365-390).
[4]. Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
[5]. Milanov, E. (2009). The RSA algorithm. RSA laboratories, 1-11.
[6]. ElGamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE transactions on information theory, 31(4), 469-472.
[7]. Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of computation, 48(177), 203-209.
[8]. Miller, V. S. (1985, August). Use of elliptic curves in cryptography. In Conference on the theory and application of cryptographic techniques (pp. 417-426). Berlin, Heidelberg: Springer Berlin Heidelberg.
[9]. Hankerson, D., & Menezes, A. (2021). Elliptic curve cryptography. In Encyclopedia of Cryptography, Security and Privacy (pp. 1-2). Berlin, Heidelberg: Springer Berlin Heidelberg.
[10]. Koblitz, N., Menezes, A., & Vanstone, S. (2000). The state of elliptic curve cryptography. Designs, codes and cryptography, 19, 173-193.
[11]. Sann, Z., Soe, T. T., & Nwe, K. M. (2019). Comparison of Public Key Cryptography in Different Security Level. International Journal of Recent Development in Engineering and Technology, 8(12).
[12]. Maqsood, F., Ahmed, M., Ali, M. M., & Shah, M. A. (2017). Cryptography: A comparative analysis for modern techniques. International Journal of Advanced Computer Science and Applications, 8(6).
Cite this article
Xie,Y. (2023). A comparative analysis of public key cryptographic algorithms: RSA, ELGamal, and elliptic curve encryption. Theoretical and Natural Science,14,91-95.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 3rd International Conference on Computing Innovation and Applied Physics
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).