Introduction to post-quantum cryptography

@inproceedings{Bernstein2009IntroductionTP,
  title={Introduction to post-quantum cryptography},
  author={Daniel J. Bernstein},
  year={2009}
}
Imagine that it’s fifteen years from now and someone announces the successful construction of a large quantum computer. The New York Times runs a frontpage article reporting that all of the public-key algorithms used to protect the Internet have been broken. Users panic. What exactly will happen to cryptography? Perhaps, after seeing quantum computers destroy RSA and DSA and ECDSA, Internet users will leap to the conclusion that cryptography is dead; that there is no hope of scrambling… 

Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms

  • R. Asif
  • Computer Science, Mathematics
  • 2021
TLDR
The key aim of this survey was to provide the scientific community with comprehensive information on elementary mathematical facts, as well as to address real-time implementation, hardware architecture, open problems, attack vectors, and the significance for the IoT networks.

Security of quantum key distribution source

TLDR
Under the conditions of the framework and proofs this thesis lies on, randomized phase turned out to have a negligible improvement over the case of non-random phase, while Fluctuating amplitude showed a larger effect, reducing system performance.

Breaking Symmetric Cryptosystems Using Quantum Period Finding

TLDR
This paper considers attacks where an adversary can query an oracle implementing a cryptographic primitive in a quantum superposition of different states, and shows that the most widely used modes of operation for authentication and authenticated encryption are completely broken in this security model.

Cryptography in the Quantum Era

TLDR
This work discusses QKD networks and post-quantum algorithms, considering their opportunities and limitations and showing that reconciliation between these two directions of cryptography is feasible and necessary for the quantum era.

Leveraging the power of quantum computing for breaking RSA encryption

TLDR
A novel approach is provided to highlight the importance of developing Post-Quantum cryptography techniques for providing a secure channel of communication.

Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum computing attack

TLDR
This paper considers the threats a quantum-capable adversary could impose on Bitcoin, which currently uses the Elliptic Curve Digital Signature Algorithm (ECDSA) to sign transactions, and proposes a simple but slow commit–delay–reveal protocol, which allows users to securely move their funds from old (non-quantum-resistant) outputs to those adhering to a Quantum-resistant digital signature scheme.

Post-quantum Cryptography and a (Qu)Bit More

TLDR
This article provides the reader with a comprehensive overview regarding post-quantum cryptography and stresses that symmetric key cryptography should receive the same amount of attention from the scientific community.

Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research

TLDR
The vulnerability of the classical cryptosystems in the context of quantum computers is analyzed, various postquantum cryptos system families are discussed, the status of the NIST post-quantum cryptography standardization process is discussed, and a couple of future research directions in this field are provided.

Quantum Differential and Linear Cryptanalysis

TLDR
This work examines more closely the security of symmetric ciphers against quantum attacks, and investigates quantum versions of differential and linear cryptanalysis techniques, showing that it is usually possible to use quantum computations to obtain a quadratic speed-up for these attack techniques, but the situation must be nuanced.

O2MD²: A New Post-Quantum Cryptosystem With One-to-Many Distributed Key Management Based on Prime Modulo Double Encapsulation

TLDR
This work uses the ring learning with errors with errors (RLWE) problem combined with arithmetic functions to propose the O2MD2 cryptosystem, which provides a one-to-many private/public key architecture having a distributed key refresh for a network of users while working on multiple polynomial rings over different prime order fields.
...

References

SHOWING 1-8 OF 8 REFERENCES

YouTube channel Tanja Lange: Post-quantum cryptography

    If lattices are completely broken, still have pre-quantum security. Standardize now? Standardize later? Standardize now! Rolling out crypto takes long time. Standards are important for adoption

    • to X25519 encryption (ECC)

    Standardize later! Current options are not satisfactory. Once rolled out, it's hard to change systems. Please wait for the research results

      school: PQCRYPTO summer school with 21 lectures on video, slides, and exercises

        Executive school (less math, more perspective)

          Some PQ libraries exist, quality is getting better

            As we transition from classical cryptography to post-quantum cryptography

              Bernstein & Tanja Lange Introduction to post-quantum cryptography