Quantum resistant public key cryptography
Authors:
Open Access
- 14 April 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 85-93
Abstract
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 protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.Keywords
This publication has 20 references indexed in Scilit:
- New lattice-based cryptographic constructionsJournal of the ACM, 2004
- The importance of the P versus NP questionJournal of the ACM, 2003
- NTRU: A ring-based public key cryptosystem1998
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- A knapsack-type public key cryptosystem based on arithmetic in finite fieldsIEEE Transactions on Information Theory, 1988
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976