- Richard Harvey

# A quantum of solace

Several questions on the recent __Computer Security lecture__, covered the knotty topic of Quantum Computing. A mystique seems to grown up around quantum computers -- can they solve problems that conventional computers cannot solve? The answer to seems to be a resounding "No". However quantum algorithms do seem to be more powerful than conventional ones for certain types of problem. One of the problematic algorithms is known as Shor's algorithm, which appears to allow integers to be factored using an algorithm that runs in polynomial. So far, the largest integer that has been factored is 21 and currently codes use integers that are powers of hundreds so you can see why there is no immediate panic.

However it is true to say that if quantum computers become more than just tiny toys, there may well be a number of common cryptographic algorithms that become broken.

That said, symmetric key encryption schemes such as blowfish, DES and AES are resistant to attack (although longer keys might be needed). So the problem will be how to exchange keys in the first place as the public key systems are crackable using powerful quantum computers. There are some promising signs that such a system is practical (via the __Open Quantum Safe project__ for example).

The other critical observation is that quantum computers will be available to not just code breakers but code users too. And there is already a nice collection of algorithms vying for standardisation (see __https://en.wikipedia.org/wiki/Post-quantum_cryptography__ for example).

So for those of you worried that your Amazon account is about to be hacked by quantum criminals I hope that provides a quantum of solace.