Quantum Computing.
unlocked by finding the two prime factors p and q of the integer number n the RSA secret key is based on. Prime factorization is believed to be an NP-class problem. That means that finding the prime factors of a number can take a classical computer a time much longer than a power of the size of the