Fundamental Structure of Shor`s Quantum Algorithm for Factoring Integers

Authors : Turgut HANOYMAK, Akram CHEHRAZİ

Pages : 78-83

View : 18 | Download : 8

Publication Date : 2019-12-31

Article Type : Research Paper

Abstract :One of the most well known mathematically hard problems in number theory is the integer factorization problem, roughly stated that decomposition of a composite number into its prime factors. In modern cryptography, RSA encryption algorithm whose security is based on integer factorization problem is highly practical, widespread and up to date no classical algorithm having polynomial running time for the factorization of large numbers is known. In 1994, Peter Shor proposed an efficient algorithm on quantum computer. In this paper, we  mention about the fundamentals of  Shor`s quantum algorithm illustrating a concrete example.
Keywords : Factorization, Measurement, Superposition Principle, Qubit