Post-quantum cryptography

@article{Bernstein2008PostquantumC,
  title={Post-quantum cryptography},
  author={Daniel J. Bernstein},
  journal={Nature},
  year={2008},
  volume={549},
  pages={188-194},
  url={https://api.semanticscholar.org/CorpusID:4446249}
}
The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
View on Nature
pure.tue.nl
1,046 Citations
Highly Influential Citations
47
Background Citations
462
Methods Citations
129
Results Citations
4

1,046 Citations

Efficient and Secured Implementation of Post-Quantum Cryptography

The challenges of implementing PQC on embedded devices and smart cards and how existing cryptographic hardware on smart cards or embedded microcontrollers can be used to accelerate post-quantum cryptography are shown.

Post-Quantum Cryptography in Use: Empirical Analysis of the TLS Handshake Performance

The Transport Layer Security (TLS) handshake performance is analyzed showing that Post-Quantum Cryptography can be as fast or even faster than classical cryptography, depending on the specific encryption and signature algorithms used.

Post-Quantum Cryptography and Quantum Cloning

The main objective of this chapter is to give an outline of major developments in privacy protectors to reply to the forthcoming threats caused by quantum systems.

Post Quantum Cryptography and its Comparison with Classical Cryptography

By contrasting quantum cryptography with its classical counterpart, it becomes evident how quantum mechanics revolutionizes the landscape of secure communication.

Learning with Errors: A Lattice-Based Keystone of Post-Quantum Cryptography

This work study the learning with errors (LWE) problem and the cryptosystems that are based on the LWE problem and, in addition, a new efficient variant of LWE cryptographic scheme is presented.

On the Efficiency of the Lamport Signature Scheme

    Dániel Zentai
  • Computer Science, Mathematics
    Land Forces Academy Review
  • 2020
This paper describes some simulation results related to the efficiency of the Lamport signature, a hash based one-time digital signature algorithm that is thought to be quantum-resistant.

Quantum Cryptography: Security for the Post-Quantum world

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.

A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography

An evaluation of security and its performance for the types of cryptographic systems considered safe against quantum attacks in the second-round NIST Post-Quantum Standardization Process, namely isogeny cryptosystems based on supersingular elliptic curves, error correction code-based encryption system, and lattice-based ring learning with errors.

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.

Quantum Safe Cryptography

    S. Yan
  • Computer Science, Physics
    Cybercryptography: Applicable Cryptography for…
  • 2018
This last chapter of the book shall introduce some of the cryptographic systems including lattice based and coding based cryptographic systems that resist all known quantum-computing attacks.
...

180 References

Initial recommendations of long-term secure post-quantum systems

This document provides the PQCRYPTO project’s initial recommendations for post-quantum cryptographic algorithms for symmetric encryption, symmetric authentication, public-key encryption, and…

Chosen-Ciphertext Security for Any One-Way Cryptosystem

This paper presents a generic technique to make a highly secure cryptosystem from any partially trapdoor one-way function, in the random oracle model, and presents the first scheme whose security is relative to the factorization of large integers, with a perfect reduction.

A Summary of McEliece-Type Cryptosystems and their Security

The main focus of this paper is to provide detailed insight into the state of art of cryptanalysis of the McEliece cryptosystem and the effect on different cryptographic applications.

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.

A "Medium-Field" Multivariate Public-Key Encryption Scheme

This work presents the new encryption scheme MFE, and provides a performance and security review, and discusses how MFE avoids previously known pitfalls of this genre while addressing its security concerns.

NTRU PRIME

  • Computer Science, Mathematics
  • 2019
An effective practical algorithm is developed for construction and experimental confirmation of the built-in system-wide parameters and keys of cryptographic transformations of the ASC and KEP of 6-7 levels of stability based on transformations in a ring of polynomials over finite fields.

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.
...

Related Papers

Showing 1 through 3 of 0 Related Papers