Post-quantum cryptography

  title={Post-quantum cryptography},
  author={Daniel J. Bernstein},
  • D. Bernstein
  • Published 17 November 2008
  • Computer Science, Mathematics
  • Nature
Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for… 
Quantum Cryptography: Security for the Post-Quantum world
  • Computer Science, Mathematics
  • 2020
This paper will discuss the current quantum cryptographic techniques both available and in development, such as: quantum key distribution (QKD), quantum networks, delegated quantum computing techniques (BQC and QHE) and quantum random number generators (QRNGS), along with a new classical scheme heralded as a classical QKD-like protocol.
Brief Study of Quantum Cryptography Applications
This paper is discussing possibilities of quantum cryptography applications and how many applications can use quantum cryptography as back bone like secure key distribution, secure direct communications, large prime factorization, e-commerce,e-governance, quantum internet and many more.
Information Security in the Quantum Era. Threats to modern cryptography: Grover’s algorithm
This article discusses Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers and presents its formal description and an implementation of the algorithm using IBM's Qiskit framework, which allows us to simulate and run the program on a real device.
Post-quantum cryptography: lattice-based cryptography and analysis of NTRU public-key cryptosystem
The scrutiny done since its presentation until now reveal that NTRU is secure and is a good successor for replacing the current constructions currently in use, which makes it considerably faster than RSA and ECC.
Quantum cryptography beyond quantum key distribution
This review article, aimed primarily at cryptographers unfamiliar with the quantum world, survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.
Code-based Post-Quantum Cryptography
A review of the various post-quantum cryptography algorithms in specific, code-based cryptography research dimensions and the research directions that are yet to be explored is another key contribution of this paper.
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.
Quantum-assisted QD-CFS signatures
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
  • R. Asif
  • Computer Science, Mathematics
  • 2021
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.
A practical hybrid quantum-safe cryptographic scheme between data centers
The demonstration shows a first step of quantum-safe secure data transfer solution in real data center environment, with the advantages of low cost, high stability, and easy operation.


Hash-Based Signatures
This note describes a digital signature system based on cryptographic hash functions, following the seminal work in this area of Lamport, Diffie, Winternitz, and Merkle, as adapted by Leighton and
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
GCM is shown to be the most efficient mode of operation for high speed packet networks, by using a realistic model of a network crypto module and empirical data from studies of Internet traffic in conjunction with software experiments and hardware designs.
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.
Public-Key Cryptosystem Based on Isogenies
The paper describes theoretical background and a publickey encryption technique, followed by security analysis and consideration of cryptosystem parameters selection, and proposes ElGamal public-key encryption and Diffie-Hellman key agreement for an isogeny Cryptosystem.
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.
Applying Grover's Algorithm to AES: Quantum Resource Estimates
It is established that for all three variants of AES key size 128, 192, and 256i¾źbit that are standardized in FIPS-PUB 197, there are precise bounds for the number of qubits and thenumber of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
  • P. Kocher
  • Computer Science, Mathematics
  • 1996
By carefully measuring the amount of time required tm perform private key operalions, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems.
SPHINCS: Practical Stateless Hash-Based Signatures
A high-security post-quantum stateless hash-based signature scheme that signs hundreds of messages per second on a modern 4-core 3.5GHz Intel CPU, allowing it to be a drop-in replacement for current signature schemes.
McBits: Fast Constant-Time Code-Based Cryptography
This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks, and achieves a reciprocal decryption throughput of just 60493 cycles on a single Ivy Bridge core.
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.