Post-Quantum Cryptography: State of the Art

  title={Post-Quantum Cryptography: State of the Art},
  author={Johannes A. Buchmann and Denis Butin and Florian G{\"o}pfert and Albrecht Petzoldt},
  booktitle={The New Codebreakers},
Because of public-key cryptography’s relevance and quantum computers’ increasingly realistic threat to this technology, it’s necessary to come up with practical and secure postquantum cryptography. This special issue aims to present the state of the art and the grand challenges in postquantum cryptography and to discuss the transition of real-world systems to the new technology. 

Digital signatures over hash-entangled chains

A new approach for digital signature based on hash chains that is supported on the well known security principles of hash functions and is a promissory alternative for digital signatures for the quantum era.

Digital signatures over hash ‐ entangled chains

A new approach for digital signature based on hash chains that is supported on the well known security principles of hash functions and is a promissory alternative for digital signatures for the quantum era.

Survey on Quantum Resist Public Key Algorithms Compatible for Java Card

This paper surveys quantum resistant algorithms that could be new alternative to current standard scheme for public key identification to employ Quantum safe Security in Java Cards.

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

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.

Assessing the overhead of post-quantum cryptography in TLS 1.3 and SSH

This paper evaluates protocol handshake performance when both post-quantum key exchange and authentication are integrated into TLS and SSH and finds that the introduced handshake latency ranges between 1-300% for TLS and 0.5-50% for SSH depending on the post-Quantum algorithms used.

Securing the Internet of Things in a Quantum World

The impacts of quantum computers on the security of the cryptographic schemes used today are demonstrated, and an overview of the recommendations for cryptographic schemes that can be secure under the attacks of both classical and quantum computers are given.

Two Post-Quantum Signature Use-cases: Non-issues, Challenges and Potential Solutions∗

This work is evaluating two post-quantum signature use-cases and analyzes the signature schemes that seem most appropriate for them and proposes suitable parameters and shows that Hash-Based Signatures are good candidates for image signing.

Post-Quantum Hash-Based Signatures for Secure Boot

This work investigates two post-quantum, hash-based signature schemes published by the Internet Engineering Task Force and submitted to the National Institute of Standards and Technology for use in secure boot and proves that Post-Quantum signatures would not have material impact on image signing.

Seven Steps to a Forever-Safe Cipher (An Introduction to Poly-Substitution Encryption)

Poly-Substitution encryption is introduced and advances in searching for unconditional security instead of complexity are shared and a path to a whole different cryptography based on simplicity and resistant not only to quantum attacks but also to what may come later, including attackers with infinite computational power is light.

Making Existing Software Quantum Safe: Lessons Learned

The outcome of the study shows that the 7E roadmap is effective in helping to plan the evolution of existing software security features towards quantum safety, and gives developers a structured way to start preparing for the quantum advantage era.



Post-quantum cryptography

The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.

Secure and Anonymous Hybrid Encryption from Coding Theory

This work presents a hybrid construction based on the Niederreiter framework that provides IND- CCA security in the random oracle model that satisfies the IK-CCA notion of anonymity whose importance is ever growing in the cryptographic community.

CyclicRainbow - A Multivariate Signature Scheme with a Partially Cyclic Public Key

This paper extends the idea of how to reduce the public key size of the UOV scheme of Petzoldt et al. to the Rainbow signature scheme of Ding and Schmidt.

New Directions in Cryptography

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.

NTRU: A Ring-Based Public Key Cryptosystem

NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory to create a new public key cryptosystem.

A public key cryptosystem and a signature scheme based on discrete logarithms

  • Taher El Gamal
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 1984
A new signature scheme is proposed, together with an imple- mentation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.

Introduction to Cryptography

  • M. AzizS. Akbar
  • Computer Science
    2005 International Conference on Microelectronics
  • 2005
In today's world of communications it is very necessary to implement some kind of security, whether it is implemented through hardware like FPGAs, μ-Controllers, or through software in your PCs.

McEliece Cryptosystem Implementation: Theory and Practice

An implementation with a complete description of the algorithmic choices and parameters selection, together with the state of the art in cryptanalysis is provided, which provides a reference for measuring speed and scalability of this cryptosystem.

Linear Recurring Sequences for the UOV Key Generation

This paper uses an idea to create a multivariate signature scheme whose public key is mainly given by a linear recurring sequence (LRS) and is able to reduce the size of the public key by up to 86%.

XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions

XMSS is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family.