The major concern is the RSA encryption scheme. The scheme is secure because it relies on the condition that factoring a large number into its primes is too time-consuming. When trying to find the prime numbers, there are many strategies, so the simplest one is to guess and try. A trial and error approach isn’t practical, though, since a 2,048 -bit number has millions of solutions. Some strategies can reduce the number of possible solutions, but even the most powerful methods will take years or millions of years. With the right algorithms, a quantum computer could reduce that time to a practical level. Efforts are underway to create other algorithms that are not breakable this way.
While this is prudent, the risk that a quantum computer can do this within…
You're reading a preview of
APC (Digital) - 1 Issue, March 2019