Traditional cyber security is based on what are known as one-way functions, mathematical problems that are easy to compute in one direction, but difficult to compute in the opposite direction. A paradigmatic case is the prime factorisation problem. Universally employed asymmetric key encryption algorithms such as the RSA algorithm are based on this problem. The security of such algorithms is based on the difficulty of computing the inverse problem for traditional computing. However, quantum computing through algorithms such as Shor's algorithm offers the possibility of solving this problem exponentially faster, destroying the security of current encryption algorithms. It is not yet possible to implement such algorithms on a scale large enough to compromise current cybersecurity systems.
However, the possibility of hardware advances in the coming years, as well as the development of new algorithms that require fewer resources, has led to a great deal of effort being devoted to strengthening cryptographic algorithms. Among the proposed solutions are both classical, post-quantum cryptography, and quantum, quantum key distribution. Cybersecurity in today's digital economy, industry and business is of crucial importance. For more information see our white paper.
The first algorithm that is typically associated with quantum computing is the Shor algorithm [1], which is seen as a significant potential threat to the current cybersecurity paradigm.
In the context of quantum computing and its potential impact, the security of communications is a key concern. However, how might this new method of computing impact the security of our communications? The answer lies in the use of prime numbers.