# Quantum resistant public key cryptography: a survey

@inproceedings{Perlner2009QuantumRP, title={Quantum resistant public key cryptography: a survey}, author={Ray A. Perlner and David A. Cooper}, booktitle={IDtrust '09}, year={2009} }

Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that…

## 99 Citations

Code-Based Public-Key Encryption

- Computer Science, Mathematics
- 2014

A short survey of public-key encryption schemes based on hardness of general decoding, including the McEliece PKE, which is believed to be resistant even against attacks using quantum computers, which makes them candidates for the so-called post-quantum cryptography.

Quantum Safe Cryptography

- Computer Science, MathematicsCybercryptography: Applicable Cryptography for Cyberspace Security
- 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.

Limitations of Practical Quantum Cryptography

- Computer Science, Mathematics
- 2011

In this paper the various limitations of quantum cryptography along with its many real time implementation problems are described.

An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives

- Computer Science, Mathematics2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)
- 2019

This current paper provides a comparative study of existing cryptanalysis data for lattice-based asymmetric cryptographic primitives and provides such a comparison as to whether these algorithms are resistant to quantum computing attacks.

Will quantum computers be the end of public key encryption?

- Computer Science
- 2017

It is argued that there are many fields of mathematics that can be used for creating ‘quantum resistant’ cryptographic schemes and that the range of quantum algorithms that pose a threat to public key encryption schemes is likely to be limited in future.

ELLIPTIC CURVE CRYPTOGRAPHY: PRE AND POST QUANTUM

- Computer Science, Mathematics
- 2016

This paper provides a description of how elliptic curves are used in modern cryptography, as well as their current limitations and future prospects, and describes the recent progress on super singular elliptIC curves isogenies, which may offer a quantum resistant cryptosystem and a viable alternative for the future of elliptic curve based cryptography.

Cryptology Management in a Quantum Computing Era

- Computer Science, Mathematics
- 2012

This study provides an original implementation of hash-based digital signature and detailed instructions on its use as well as customization of the N TRU lattice-based cryptography suite, including the use of NTRU and AES together in a hybrid cryptographic protocol.

Report on Post-Quantum Cryptography

- Computer Science
- 2016

The National Institute of Standards and Technology (NIST)'s current understanding about the status of quantum computing and post-quantum cryptography is shared, and NIST’s initial plan to move forward is outlined.

Attacks on practical quantum key distribution systems (and how to prevent them)

- Computer Science
- 2015

The so-called field of quantum hacking is introduced by summarising a variety of attacks and their prevention mechanisms, thereby preventing future attacks and enhancing the practical security of QKD.

An efficient quantum meet-in-the-middle attack against NTRU-2005

- Computer Science, Mathematics
- 2013

A new way to find NTRU-2005 private key is proposed, based on meet-in-the-middle attack and a quantum algorithm for searching the fixed weight target that has lower time and space complexity.

## References

SHOWING 1-10 OF 65 REFERENCES

Use of Elliptic Curves in Cryptography

- Computer Science, MathematicsCRYPTO
- 1985

An analogue of the Diffie-Hellmann key exchange protocol is proposed which appears to be immune from attacks of the style of Western, Miller, and Adleman.

Public-Key Cryptosystems from Lattice Reduction Problems

- Computer Science, MathematicsCRYPTO
- 1996

A new proposal for a trapdoor one-way function, from which the security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS.

A Chosen-Ciphertext Attack against NTRU

- Computer Science, MathematicsCRYPTO
- 2000

This paper examines the effect of feeding special polynomials built from the public key to the decryption algorithm, and is able to conduct a chosen-ciphertext attack that recovers the secret key from a few ciphertexts/cleartexts pairs with good probability.

Post-Quantum Signatures

- Computer ScienceIACR Cryptol. ePrint Arch.
- 2004

Digital signatures have become a key technology for making the Internet and other IT infrastructures secure. But in 1994 Peter Shor showed that quantum computers can break all digital signature…

NTRU: A Ring-Based Public Key Cryptosystem

- Computer Science, MathematicsANTS
- 1998

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

- Computer Science, MathematicsCRYPTO 1985
- 1985

A new signature scheme is proposed, together with an implementation 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.

How to Achieve a McEliece-Based Digital Signature Scheme

- Computer ScienceASIACRYPT
- 2001

This paper disproves the belief that code-based cryptosystems like McEliece do not allow practical digital signatures, and shows a way to build a practical signature scheme based on coding theory.

A modification of the RSA public-key encryption procedure (Corresp.)

- Computer Science, MathematicsIEEE Trans. Inf. Theory
- 1980

For this modified version of the RSA scheme, it is shown that, if the encryption procedure can be broken in a certain number of operations, then R can be factored in only a few more operations.

Elliptic curve cryptosystems

- Mathematics, Computer Science
- 1987

The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.

A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem

- Computer Science, MathematicsFOCS 1982
- 1982

This paper shows that the basic variant of the Merkle-Hellman cryptosystem, in which the elements of the public key are modular multiples of a superincreasing sequence, is breakable in polynomial time.