A STUDY ON CRYPTOGRAPHIC METHODS FOR ENHANCING CYBERSECURITY

Authors

  • Ayushman Palo M.tech (Applied AI), Visvesvaraya National Institute of Technology (VNIT), Nagpur, Orcid ID: 0009-0000-6615-7957,
  • Rashmita Badatya Assistant Professor, (Gandhi engineering college, Bhubaneswar), Visvesvaraya National Institute of technology,
  • Dr. Surender Khan Assistant Professor, Department of Commerce, Shyama Prasad Mukherjee College for Women, University of Delhi,
  • Pankaj Bhardwaj Assistant Professor, Pyramid College of Business & Technology, Phagwara-144401
  • Dr. Mostaque Md. Morshedur Hassan Assistant Professor, Department of Computational Sciences, Brainware University, Kolkata,

DOI:

https://doi.org/10.53555/eijms.v11i1.86

Keywords:

Cryptography, Number Theory, Post-Quantum Security, Computational Complexity

Abstract

Data security and confidentiality in cryptography depend on mathematical foundations for its implementation. The examination of cryptographic methods throughout this document explains the role of number theory in RSA and elliptic curve algebra in ECC and finite field arithmetic in AES. This research explores two post-quantum cryptographic techniques that employ lattice-based systems and multivariate polynomial systems for their quantum attack defenses. The assessment investigates how statistical and probabilistic techniques operate in cryptanalysis and shows the difficulties of finding an appropriate balance between computational depth and system efficiency. Future studies need to prioritize two aims: establishing quantum-resistant cryptographics along enhancing mathematical security demonstrations while maximizing the efficiency of cryptographic systems.

References

Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (1996). Handbook of Applied Cryptography. CRC Press.

Stallings, W. (2018). Effective cybersecurity: a guide to using best practices and standards. Addison-Wesley Professional.Katz, J., & Lindell, Y. (2020). Introduction to Modern Cryptography. CRC Press.

Gnatyuk, S., Berdibayev, R., Smirnova, T., Avkurova, Z., & Iavich, M. (2021, October). Cloud-Based Cyber Incidents Response System and Software Tools. In International Conference on Information and Software Technologies (pp. 169-184). Cham: Springer International Publishing.

Rangaraju, S. (2023, December 1). AI SENTRY: REINVENTING CYBERSECURITY THROUGH INTELLIGENT THREAT DETECTION. EPH - International Journal of Science and Engineering, 9(3), 30–35. https://doi.org/10.53555/ephijse.v9i3.211

Shor, P. W. (1999). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2), 303-332.

Silverman, J. H., Pipher, J., & Hoffstein, J. (2008). An introduction to mathematical cryptography (Vol. 1). Springer New York.

Goldreich, O. (2004). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press

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.

Koblitz, N. (1994). A Course in Number Theory and Cryptography. Springer.

Silverman, J. H. (2009). The Arithmetic of Elliptic Curves. Springer.

McEliece, R. J. (1978). A Public-Key Cryptosystem Based on Algebraic Coding Theory. DSN Progress Report.

Shannon, C. E. (1949). Communication Theory of Secrecy Systems. Bell System Technical Journal.

Goldwasser, S., & Bellare, M. (1996). Lecture notes on cryptography. Summer course “Cryptography and computer security” at MIT, 1999, 1999.

Downloads

Published

2025-06-25
Share |