Cryptography at stake
The greater computation speed that can be achieved by exploiting quantum computers has immediately represented a potential threat to the security of cryptographic algorithms, which are based precisely on the practical impossibility of solving some mathematical problems (such as factoring large integer numbers in prime factors) in a relatively short period of time.
As we know from Chapter 2, Cryptography Essentials, the reduction of prime factors of large integers (also known as the integer factorization problem) is considered a problem that cannot be immediately solved with current mathematical knowledge.
In fact, finding the prime factors of a large integer number adopting the brute force approach (essentially by trial ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access