Quantum Computing.
Shor’s algorithm to factor n in primes grows as the square of l. The Shor’s algorithm has two phases. The first phase doesn’t require quantum computing so I will just touch upon it briefly. It is pretty straightforward for a classical computer and simply maps the original problem to a different