Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

EduVision: Journal of Innovations in Pedagogy and Educational Advancements

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

Mohinur Raupova, Muhammad Masharipov, Aliya Tagayeva

Published Apr 8, 2025• 0 citations
OpenAlex

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.

Related papers

Quantum Cryptanalysis of the RSA Cipher

Machado, Pedro Dinis de Paulo

This dissertation analyzes the impact of quantum computing on the security of classical cryptographic systems, with a focus on the vulnerability of the RSA algorithm. RSA cryptography is based on the difficulty of factoring large prime numbers, a task considered computationally very difficulty for classical computers. However, with quantum computing, especially through Shor’s algorithm—this barrier can be overcome. Shor’s algorithm allows factorization in polynomial time, which would completely compromise the security of RSA.The dissertation presents the theoretical foundations of both cryptography and quantum computing, explaining key concepts such as qubits, superposition, entanglement, and quantum parallelism. It details the operation of Shor’s algorithm, from identifying the period of the modular exponential function to applying the Quantum Fourier Transform (QFT) and phase estimation to obtain the prime factors of a composite number.In addition to the theoretical component, the work includes practical implementations of the algorithm in both classical and simulated quantum environments, using IBM’s Qiskit library. Finally, it discusses post-quantum cryptography as a secure alternative in light of technological advancements, highlighting methods based on lattices, codes, hash functions, and multivariate systems.The conclusion emphasizes the urgency of adopting cryptographic systems resistant to quantum computing, as ongoing advances increasingly make the breaking of RSA a realistic threat. Post-quantum cryptography is mentioned as a necessary response to the challenge posed by quantum computing.In conclusion, although current quantum computers do not yet have sufficient power to break RSA in practice, technological progress is steadily bringing that scenario closer. Therefore, it is essential to develop and adopt quantum-resistant cryptographic systems to ensure information security in the coming decades.

•Jul 17, 2025•0 citations

Quantum Computing and Its Implications for Cryptography: Assessing the Security and Efficiency of Quantum Algorithms

K. L. Sumathy, M. Megala, Sasanko Sekhar Gantayat +1 more

Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.

Nanotechnology Perceptions•Dec 1, 2024•0 citations

QUANTUM THREAT TO CLASSICAL CRYPTOGRAPHY: A FOCUS ON RSA

Lina Kankevičienė, Andrius Račkauskas

Cryptography is crucial for protecting private information. However, the emergence of quantum computing poses a significant threat to the security of classical cryptographic systems. Traditional algorithms such as RSA can be vulnerable to quantum attacks. Shor's quantum algorithm can break RSA encryption in polynomial time. This article examines the RSA cryptosystem, the impact of quantum computing on cryptography, the challenges of quantum computing, and its applications in various fields. The article also presents an experiment comparing traditional and Shor factorization methods for semi-prime numbers. Although the experiment does not involve factoring extremely large numbers, it demonstrates the simplicity of implementing algorithms. By conducting experiments and analysing the results, computer science students can better understand the principles of quantum computing, its capabilities, and limitations, and develop practical skills.

•Jan 1, 2025•0 citations

Quantum computing's role in: Cryptography Security System

Arjun Mishra

The advent of quantum computing has brought both excitement and apprehension across scientific and technological domains. Unlike classical computers, which operate using binary states (0s and 1s), quantum computers leverage the principles of superposition and entanglement to perform calculations at unparalleled speeds. This capability enables quantum systems to tackle problems previously deemed computationally infeasible. While this breakthrough has far-reaching applications in areas such as material science, artificial intelligence, and optimization, it poses a significant threat to modern cryptographic systems. Quantum computing introduces unprecedented computational capabilities that challenge the very foundation of modern cryptographic systems. Traditional encryption techniques, such as RSA and ECC, are particularly vulnerable to quantum algorithms like Shor's, which can solve problems in polynomial time that classical computers find infeasible. This paper delves into quantum-resistant cryptographic techniques, particularly lattice-based cryptography and multivariate polynomial schemes, as sustainable alternatives. The research analyzes the advancements in quantum hardware, evaluates current vulnerabilities, and proposes a hybrid cryptographic framework for secure communication in a post-quantum era. By combining theoretical exploration with practical simulations, the study offers insights into building resilient cryptographic systems that ensure longterm data security in the quantum era.

•Jan 8, 2026•0 citations

A cryptographic analysis of quantum computing

Mayank Purohit, Rahul Singh Chauhan, Ruchira Rawat

The advent of quantum computing ushers in a new era of computational capability and challenges the fundamental principles of modern cryptography. Quantum computers with the ability to solve difficult mathematical problems exponentially faster pose an immediate danger to conventional encryption procedures, which are currently thought to be secure in the world of classical computing. This paper explores the fundamental effects of quantum computing on cryptography, showing how quantum algorithms, like Shor's algorithm, may effectively factor big numbers and solve discrete logarithm issues, making popular encryption techniques susceptible. The study looks into how susceptible traditional encryption methods like RSA and ECC are to quantum assaults, highlighting how urgent it is to switch to quantum-resistant cryptographic solutions.

CRC Press eBooks•Nov 19, 2024•2 citations

Evaluating the Quantum Capabilities in Factorization RSA Modulus

Yaser Alkurdi, Qasem S. Abu Al-Haija

Quantum computing has emerged as a groundbreaking technology, revolutionizing the speed and capabilities of computation. Traditional computing, based on bits represented by 0s and 1s, has limitations in storage and computational efficiency, even with parallel processing. In contrast, quantum computing operates on qubits, enabling exponential reductions in storage requirements and faster computation via quantum parallelism. One prominent quantum algorithm, Shor's Algorithm, presents a significant threat to RSA encryption. This Algorithm efficiently factors large integers, a task considered intractable for classical computers. By leveraging classical and quantum computation techniques, Shor's Algorithm employs the Euclidean algorithm and the Quantum Fourier Transform (QFT) to find the greatest common divisor and perform period-finding, respectively. This research paper explores the implementation and implications of Shor's Algorithm in breaking RSA encryption. Through experiments conducted in IBM's Quantum Lab, the Algorithm successfully factorizes integers, showcasing its efficacy in practice. By examining the potential impact of quantum computing on RSA and exploring the capabilities of Shor's Algorithm, this research contributes to advancing the field of quantum computing and understanding its implications for modern cryptographic systems. The findings underscore the need for post-quantum cryptography to ensure secure communication and data protection in the era of quantum computing.

International Conference on Frontiers of Engineering and Emerging Technologies (FET)•Apr 22, 2026•0 citations
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.
This dissertation analyzes the impact of quantum computing on the security of classical cryptographic systems, with a focus on the vulnerability of the RSA algorithm. RSA cryptography is based on the difficulty of factoring large prime numbers, a task considered computationally very difficulty for classical computers. However, with quantum computing, especially through Shor’s algorithm—this barrier can be overcome. Shor’s algorithm allows factorization in polynomial time, which would completely compromise the security of RSA.The dissertation presents the theoretical foundations of both cryptography and quantum computing, explaining key concepts such as qubits, superposition, entanglement, and quantum parallelism. It details the operation of Shor’s algorithm, from identifying the period of the modular exponential function to applying the Quantum Fourier Transform (QFT) and phase estimation to obtain the prime factors of a composite number.In addition to the theoretical component, the work includes practical implementations of the algorithm in both classical and simulated quantum environments, using IBM’s Qiskit library. Finally, it discusses post-quantum cryptography as a secure alternative in light of technological advancements, highlighting methods based on lattices, codes, hash functions, and multivariate systems.The conclusion emphasizes the urgency of adopting cryptographic systems resistant to quantum computing, as ongoing advances increasingly make the breaking of RSA a realistic threat. Post-quantum cryptography is mentioned as a necessary response to the challenge posed by quantum computing.In conclusion, although current quantum computers do not yet have sufficient power to break RSA in practice, technological progress is steadily bringing that scenario closer. Therefore, it is essential to develop and adopt quantum-resistant cryptographic systems to ensure information security in the coming decades.
Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.
Cryptography is crucial for protecting private information. However, the emergence of quantum computing poses a significant threat to the security of classical cryptographic systems. Traditional algorithms such as RSA can be vulnerable to quantum attacks. Shor's quantum algorithm can break RSA encryption in polynomial time. This article examines the RSA cryptosystem, the impact of quantum computing on cryptography, the challenges of quantum computing, and its applications in various fields. The article also presents an experiment comparing traditional and Shor factorization methods for semi-prime numbers. Although the experiment does not involve factoring extremely large numbers, it demonstrates the simplicity of implementing algorithms. By conducting experiments and analysing the results, computer science students can better understand the principles of quantum computing, its capabilities, and limitations, and develop practical skills.
The advent of quantum computing has brought both excitement and apprehension across scientific and technological domains. Unlike classical computers, which operate using binary states (0s and 1s), quantum computers leverage the principles of superposition and entanglement to perform calculations at unparalleled speeds. This capability enables quantum systems to tackle problems previously deemed computationally infeasible. While this breakthrough has far-reaching applications in areas such as material science, artificial intelligence, and optimization, it poses a significant threat to modern cryptographic systems. Quantum computing introduces unprecedented computational capabilities that challenge the very foundation of modern cryptographic systems. Traditional encryption techniques, such as RSA and ECC, are particularly vulnerable to quantum algorithms like Shor's, which can solve problems in polynomial time that classical computers find infeasible. This paper delves into quantum-resistant cryptographic techniques, particularly lattice-based cryptography and multivariate polynomial schemes, as sustainable alternatives. The research analyzes the advancements in quantum hardware, evaluates current vulnerabilities, and proposes a hybrid cryptographic framework for secure communication in a post-quantum era. By combining theoretical exploration with practical simulations, the study offers insights into building resilient cryptographic systems that ensure longterm data security in the quantum era.
The advent of quantum computing ushers in a new era of computational capability and challenges the fundamental principles of modern cryptography. Quantum computers with the ability to solve difficult mathematical problems exponentially faster pose an immediate danger to conventional encryption procedures, which are currently thought to be secure in the world of classical computing. This paper explores the fundamental effects of quantum computing on cryptography, showing how quantum algorithms, like Shor's algorithm, may effectively factor big numbers and solve discrete logarithm issues, making popular encryption techniques susceptible. The study looks into how susceptible traditional encryption methods like RSA and ECC are to quantum assaults, highlighting how urgent it is to switch to quantum-resistant cryptographic solutions.
Quantum computing has emerged as a groundbreaking technology, revolutionizing the speed and capabilities of computation. Traditional computing, based on bits represented by 0s and 1s, has limitations in storage and computational efficiency, even with parallel processing. In contrast, quantum computing operates on qubits, enabling exponential reductions in storage requirements and faster computation via quantum parallelism. One prominent quantum algorithm, Shor's Algorithm, presents a significant threat to RSA encryption. This Algorithm efficiently factors large integers, a task considered intractable for classical computers. By leveraging classical and quantum computation techniques, Shor's Algorithm employs the Euclidean algorithm and the Quantum Fourier Transform (QFT) to find the greatest common divisor and perform period-finding, respectively. This research paper explores the implementation and implications of Shor's Algorithm in breaking RSA encryption. Through experiments conducted in IBM's Quantum Lab, the Algorithm successfully factorizes integers, showcasing its efficacy in practice. By examining the potential impact of quantum computing on RSA and exploring the capabilities of Shor's Algorithm, this research contributes to advancing the field of quantum computing and understanding its implications for modern cryptographic systems. The findings underscore the need for post-quantum cryptography to ensure secure communication and data protection in the era of quantum computing.