Elliptic Curve Cryptography (ECC) achieves the same 128-bit security level as 3072-bit RSA but with significantly smaller key sizes. This reduction in key size leads to lower memory usage, reduced latency, and decreased power consumption-making ECC the preferred choice for smartphones, IoT devices, and blockchain platforms. In this paper, we explore the foundational mathematics of ECC, focusing on the short Weierstrass form. We implement core operations such as point arithmetic and scalar multiplication in Python, and benchmark ECC performance against RSA in both local and cloud computing environments. Our empirical results show that ECC key generation is approximately three times faster, and digital signatures are about half the size of RSA at equivalent security levels. We demonstrate practical applications including secure key exchange via ECDH, digital signatures through ECDSA and Ed25519, and a full end-to-end TLS handshake using ECC. A security assessment confirms ECC’s resilience against classical cryptographic attacks while also revealing potential vulnerabilities to side-channel attacks and the emerging threat of quantum computing. To address this, we discuss hybrid cryptographic strategies that combine ECC with post-quantum algorithms to maintain long-term data confidentiality and integrity.
C. Sajeev and G. J. A. Jose, “Elliptic curve cryptography enabled security for wireless communication,” International Journal on Computer Science and Engineering, vol. 2, no. 6, pp. 2187–2189, 2010.
C. Hanser and D. Slamanig, “Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves,” in Proceedings of SciTePress, 2013, pp. 15–26.
S. M. Farooq, S. S. Hussain, and T. S. Ustun, “Elliptic Curve Digital Signature Algorithm (ECDSA) Certificate Based Authentication Scheme for Advanced Metering Infrastructure,” in 2019 Innovations in Power and Advanced Computing Technologies (i-PACT), vol. 1, pp. 1–6, 2019.
J. W. Bos, J. A. Halderman, N. Heninger, J. Moore,
M. Naehrig, and E. Wustrow, “Elliptic curve cryptography in practice,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security, 2014.
U. Gulen and S. Baktir, “Elliptic curve cryptography for wireless sensor networks using the number theoretic transform,” Sensors, vol. 20, no. 5, p. 1507, 2020.
M. Alvarado, L. Gayler, A. Seals, T. Wang, and
T. Hou, “A Survey on Post-Quantum Cryptography: State-of-the-Art and Challenges,” arXiv preprint, 2024.
T. Attema, N. Gervasoni, M. Marcus, and G. Spini, “Post-Quantum Cryptography: Computational-Hardness Assumptions and Beyond,” Cryptology ePrint Archive, 2021.
B. Koziel et al., “Post-quantum cryptography on FPGA based on isogenies on elliptic curves,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 64, no. 1, pp. 86–99, 2016.
N. Koblitz and A. Menezes, “Elliptic‐curve cryptography for wireless sensor network nodes without hardware multiplier support,” Security and Communication Networks, vol. 9, no. 18, pp. 4992–5002, 2016.
C. A. Lara-Nino, A. Diaz-Perez, and
M. Morales-Sandoval, “Elliptic Curve Lightweight Cryptography: A Survey,” IEEE Access, vol. 6, 2018.
S. Ullah, J. Zheng, N. Din, M. T. Hussain, F. Ullah, and M. Yousaf, “Elliptic Curve Cryptography: Applications, Challenges, Recent Advances, and Future Trends: A Comprehensive Survey,” Elsevier, vol. 47, pp. 100–530, 2023.
M. J. H. Faruk, S. Tahora, M. Tasnim, H. Shahriar, and N. Sakib, “A review of quantum cybersecurity: threats, risks and opportunities,” in 2022 1st International Conference on AI in Cybersecurity (ICAIC), pp. 1–8, 2022.