COMPLEX NUMBER THEORY AND QUANTUM COMPUTERS: A NEW ERA OF MATHEMATICAL FACTORIZATION

Authors

  • Mohinur Raupova Chirchik State Pedagogical University Author
  • Muhammad Masharipov Chirchik State Pedagogical University Author
  • Aliya Tagayeva Chirchik State Pedagogical University Author

Keywords:

Factorization of composite numbers, Shor's algorithm, quantum computing, cryptography, RSA, qubits, superposition, quantum security, post-quantum cryptography.

Abstract

The factorization of composite numbers has occupied an important place in mathematics for centuries and forms the foundation of modern cryptographic systems. This paper analyzes the factorization process using traditional and quantum computers, the operating principles of Shor's algorithm, the impact of quantum technologies on cryptography, and future prospects. It has been determined that properties of quantum computers such as superposition, quantum parallelism, and quantum entanglement can significantly accelerate the factorization of composite numbers, which poses a serious threat to the security of cryptographic algorithms like RSA. According to the research results, the current state of quantum computer development, recent achievements in the field of factorization, and quantum-secure cryptography methods have been analyzed, demonstrating their mathematical and cryptographic significance.

Downloads

Published

2025-04-08

Issue

Section

Articles

How to Cite

COMPLEX NUMBER THEORY AND QUANTUM COMPUTERS: A NEW ERA OF MATHEMATICAL FACTORIZATION. (2025). EduVision: Journal of Innovations in Pedagogy and Educational Advancements, 1(4), 1-11. https://brightmindpublishing.com/index.php/ev/article/view/391