Research project

Quantum computer-resistant cryptographic algorithmspromising

We were able to reduce the latency of the calculation of a SPHINCS+ signature to 1 millisecond. This corresponds to an acceleration by a factor of 6 compared to the previous record. Another highlight is the discovery and publication of a new type of hardware attack on the otherwise promising NewHope key exchange procedure.

Danger of quantum computers

Powerful quantum computers will be able to break some current cryptographic methods in the future. Shor’s algorithm for calculating prime factors and logarithms can be implemented so efficiently on these computers that current public key procedures must be considered cracked. If the quantum computer can be built one day, secure communication via the internet will face a huge problem. Is it possible to replace the existing methods with quantum computer-resistant methods?

Pdf