MATHEMATICAL FOUNDATIONS, ALGORITHMS AND SECURITY ANALYSIS POST-QUANTUM CRYPTOGRAPHY

Authors

  • Muhamediyeva Dilnoz Tulkunovna Автор
  • Tagaev Farkhad Abduvakhabovich Автор

DOI:

https://doi.org/10.5281/zenodo.19995791

Abstract

The rapid development of quantum computing technologies poses a serious threat to modern public-key cryptographic systems. Classical cryptographic algorithms such as RSA and elliptic-curve cryptography rely on mathematical problems that can be efficiently solved using quantum algorithms. Post-quantum cryptography (PQC) aims to develop cryptographic schemes that remain secure even in the presence of quantum adversaries. This paper investigates the mathematical foundations of PQC, focusing on lattice-based, code-based, and hash-based cryptographic constructions. Security models based on computational complexity theory are analyzed, and illustrative examples using Learning With Errors (LWE) and decoding problems are presented. Experimental analysis demonstrates that PQC schemes provide strong resistance against both classical and quantum attacks when appropriate parameters are selected. The results highlight the importance of adopting new cryptographic standards to ensure long-term data security in quantum computing environments. 

 

Downloads

Published

2026-05-03

How to Cite

Muhamediyeva, D., & Tagaev, F. (2026). MATHEMATICAL FOUNDATIONS, ALGORITHMS AND SECURITY ANALYSIS POST-QUANTUM CRYPTOGRAPHY. International Conference on Engineering & Technology, 2(4), 223-226. https://doi.org/10.5281/zenodo.19995791