Shor's Algorithm & The Impact of Quantum Computing
Finding the prime factorization of big numbers is known to be computationally expensive to do and is the concept our current digital security and encryption methods are built on. This is because multiplying 2 prime numbers together is way faster and easier than finding the prime factorizations themselves. This is why Shor’s algorithm, an algorithm that allows quantum computers to efficiently (in polynomial time compared to exponential) find the prime factors of a given composite number, got a lot of attention and was seen as a threat to against digital infrastructure and security....