• Marco Russo (Politecnico di Torino)


    Current Realizability of Shor’s Algorithm

    Categories: Posts

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

  • Alessandro Pino (LINKS Foundation)


    New Problems Become Post-Quantum Solutions

    Categories: Posts

    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.

  • Antonio J. Di Scala (Politecnico di Torino)


    Quantum Computers’ Role in Shor’s Algorithm

    Categories: Posts

    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.

  • Andrea Vesco (LINKS Foundation)


    QUBIP is all about Transition to PQC

    Categories: Posts

    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.