Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM65171
Volume:
10 |
6 |
Jun 2026
Pages:
1-5
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Mathematics
Shri Rawatpura Sarkar University, Raipur, Chhattisgarh, India
Department of Mathematics, Faculty of Science,
Shri Rawatpura Sarkar University, Raipur, Chhattisgarh, India
The fast growth of digital communication and cloud computing has led to a significant increase in the need for strong cryptographic systems. Modern cryptographic techniques like RSA, Diffie-Hellman and Elliptic Curve Cryptography (ECC) are mathematically based on number theory. The paper investigates the applicability of number theory principles in modern cybersecurity and their importance in Post-Quantum Cryptography (PQC). The paper compares conventional and post quantum encryption methods. The comparison is done based on the computational complexity, key size, execution time and security strength. Experiments have demonstrated that lattice-based cryptography and elliptic curve systems have greater resistance to modern cyber threats, while maintaining computational efficiency. From the results, it is evident that integrating advanced number theoretic methods with post-quantum algorithms can significantly improve future cybersecurity frameworks.
KEYWORDS
Number theory remains the cornerstone of modern cryptography and cybersecurity. Although classical algorithms such as RSA and ECC have provided robust security mechanisms for decades, the emergence of quantum computing necessitates the development of quantum-resistant cryptographic systems. The comparative analysis performed in this study indicates that lattice-based post-quantum algorithms offer improved security and computational efficiency. The integration of advanced number-theoretic principles with post-quantum cryptography can significantly enhance future digital security infrastructures.
1. M. Kumar, “Post-quantum cryptography algorithm’s standardization and performance analysis,” Array, vol. 15, Art. no. 100242, Sep. 2022. 2. O. Regev, “An efficient quantum factoring algorithm,” J. ACM, vol. 72, no. 1, pp. 1–13, Feb. 2025. 3. H. Y. Wong, “Shor’s algorithm,” in Introduction to Quantum Computing: From a Layperson to a Programmer 30 Steps. Cham, Switzerland: Springer, 2023, pp. 289–298. 4. D. Sarah and C. Peter, “On the practical cost of Grover for AES key recovery,” in Proc. 5th NIST Post-Quantum Cryptography Standardization Conf., 2024. 5. T. Niraula, A. Pokharel, A. Phuyal, P. Palikhel, and M. Pokharel, “Quantum computers’ threat on current cryptographic measures and possible solutions,” Int. J. Wireless Microw. Technol., vol. 12, no. 5, pp. 10–20, Oct. 2022. 6. J. Preu-Mattsson, B. Smeets, and E. Thormarker, “Quantum-resistant cryptography,” arXiv preprint arXiv:2112.00399, 2021. 7. Ferreira, V. Lipiäinen, and C. Polito, “Quantum technologies and cybersecurity,” Centre for European Policy Studies (CEPS), Brussels, Belgium, CEPS Papers 41629, 2023. 8. G. R. Pandeya, T. Daim, and A. Marotzke, “A strategy roadmap for post-quantum cryptography,” in Roadmapping the Future of Technology, 2021, pp. 171–207. 9. B. Akande, “The race to quantum-resilient infrastructure: National and global strategies for cybersecurity readiness,” Tech. Rep., Apr. 2025. 10. Silonosov and L. Henesey, “Towards cryptographic agility manifesto in end-to-end encryption systems: A position paper from the perspective of crypto-consumers,” in Proc. IEEE Conf. Dependable, Autonomic Secure Comput. (DASC), Nov. 2024, pp. 65–72.
Publication Date
6/18/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
3
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...