TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Secure key exchange and digital signatures via elliptic curves and discrete mathematical principles 

, , , , , *

* Corresponding author · click or hover a name for details

pp. 3081–3089Vol. 28Issue 8December 2025DOI: 10.47974/JDMSC-2469 Crossmark XML
Received:
03 Jul 2025
Published Online:
08 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2469
Pages:
3081–3089

Abstract

A strong framework for creating safe and effective cryptographic systems, elliptic curve cryptography (ECC) is especially useful for digital signature and key exchange protocols. Based on the principles of algebraic geometry and discrete mathematics, ECC requires significantly shorter key lengths while achieving the same level of security as traditional algorithms like RSA, making it ideal for contemporary settings where resource optimization and computational speed are crucial. With a focus on combinatorial logic and discrete structures, this paper explores the mathematical foundations of ECC and highlights how they contribute to its reliability and robustness. In-depth examinations of signature systems like the Elliptic Curve Digital Signature Algorithm (ECDSA) and key exchange strategies like Elliptic Curve Diffie–Hellman (ECDH) are given. In-depth analyses are also conducted of implementation issues, potential attack routes, and the importance of ECC in both present-day and next-generation cryptographic frameworks.

Keywords

Subject Classifications

Primary 93A30Secondary 49K15

References

[1] R. Imam, Q. M. Areeb, A. Alturki, and F. Anwer, “Systematic and critical review of RSA based public key cryptographic schemes: Past and present status,” IEEE Access, vol. 9, pp. 155949–155976 (2021), doi: 10.1109/ACCESS.2021.3129224.
[2] L. Qian, Z. Luo, Y. Du, and L. Guo, “Cloud computing: An overview,” in Proc. IEEE Int. Conf. Cloud Comput., pp. 626–631 (Dec. 2009).
[3] G. S. Puri, R. Tiwary, and S. Shukla, “A review on cloud computing,” in Proc. 9th Int. Conf. Cloud Comput., Data Sci. Eng., Noida, India, pp. 63–68 (Jan. 2019), doi: 10.1109/CONFLUENCE.2019.8776907.
[4] M. Sohal and S. Sharma, “BDNA-A DNA inspired symmetric key cryptographic technique to secure cloud computing,” J. King Saud Univ. - Comput. Inf. Sci., vol. 34, no. 1, pp. 1417–1425 (2022).
[5] A. Bhowmik and S. Karforma, “Isomorphic encryption and coupled ANN with mealy machine: A cutting-edge data security model for cloud computing environment,” Knowl. Inf. Syst., vol. 65, no. 1, pp. 133–162 (Jan. 2023), doi: 10.1007/s10115-022-01760-y.
[6] S. Lu, J. Zheng, Z. Cao, Y. Wang, and C. Gu, “A survey on cryptographic techniques for protecting big data security: Present and forthcoming,” Sci. China Inf. Sci., vol. 65, no. 10, pp. 201–301 (Oct. 2022), doi: 10.1007/s11432-021-3393-x.
[7] M. S. A. El-Seoud, H. F. El-Sofany, and I. A. Taj-Eddin, “Comparable and analytical study between some security issues in cloud computing,” in Proc. 20th Int. Conf. Interact. Collaborative Learn., vol. 2, pp. 526–539 (2018).
[8] O. K. Jasim Mohammad, S. Abbas, E.-S. M. El-Horbaty, and A.-B. M. Salem, “Securing cloud computing environment using a new trend of cryptography,” in Proc. Int. Conf. Cloud Comput. (ICCC), pp. 1–8 (Apr. 2015).
[9] “The latest cloud computing statistics [Internet],” Accessed: Aug. 12 (2023). [Online]. Available: https://aag-it.com/the-latestcloud-computing-statistics
[10] W. Li, K. Xue, Y. Xue, and J. Hong, “TMACS: A robust and verifiable threshold multi-authority access control system in public cloud storage,” IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 5, pp. 1484–1496 (May 2016), doi: 10.1109/TPDS.2015.2448095.
[11] S. M. Abrahem and A. S. Abed, “Cubic JD-fuzzy ideals of BH-algebra,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 4-A, pp. 1015–1023 (2025), doi: 10.47974/JDMSC-2035.
[12] A. A. Abbas and Z. M. Sallal, “Hybrid biometric authentication for banks security improvements,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 4-A, pp. 1037–1050 (2025), doi: 10.47974/JDMSC-2030.
[13] Z. A. Abdulrazzaq, M. S. Nayef, and M. Hbaib, “On semi-continuous and quasi-semi-continuous modules,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 4-A, pp. 1051–1058 (2025), doi: 10.47974/JDMSC-2031.
[14] B. L. V. S. Aditya and S. N. Mohanty, “Design of an efficient model for fake profile detection on social media using advanced feature engineering and deep learning techniques,” J. Inf. Optim. Sci., vol. 46, no. 6, pp. 1803–1810 (2025), doi: 10.47974/JIOS-2009.
[15] S. D. Bahinipati and B. K. Pattanayak, “A novel blockchain enabled smart contract for smart city e-governance ecosystem,” J. Inf. Optim. Sci., vol. 46, no. 6, pp. 1831–1840 (2025), doi: 10.47974/JIOS-2012.
[16] Z. S. Alsham, E. Bahçekapılı, and A. Ayaz, “Trends in IoT applications in smart campuses: A topic modeling approach,” COLLNET J. Scientometrics Inf. Manage., vol. 19, no. 1, pp. 21–40 (2025), doi: 10.47974/CJSIM-2024-017.
[17] W. Sripanya, W. Rungrottheera, and P. Hyunsin, “Fourier series analysis and computation based on function characteristics,” J. Interdiscip. Math., vol. 28, no. 6, pp. 2109–2120 (2025), doi: 10.47974/JIM-2352.

Views: 106Downloads: 4Citations: 0