Blogposts

With the advent of quantum computing, traditional cryptographic algorithms face an imminent threat of being compromised, necessitating the development and integration of post-quantum cryptographic solutions.

The IoT paradigm has grown up rapidly in recent years and it is supported by functional and heterogeneous infrastructures that are not prepared to face the future quantum attacks.

Shor’s algorithm (1994) is with no doubt the oldest quantum algorithm with an unmatched improvement with respect to classical computing.

A Cryptographically Relevant Quantum Computer (CRQC) can threaten most of the traditional public-key cryptography currently in use. If and when a CRQC occurs, this may obviously turn into a major issue for society.

In 1994, Peter Shor published a paper in which he explained how to solve the computation of discrete logarithm and the factorization of large numbers in a computationally feasible way by using a quantum computer.

Last week we celebrated the Kick-Off-Meeting of the QUBIP project. QUBIP addresses the transition to post-quantum cryptography (PQC) of protocols, networks, and systems to counter quantum threats well in advance.