• shareshare
  • link
  • cite
  • add
Other research product . Other ORP type . 2017

Post-quantum cryptography

Bernstein, D.J.; Lange, T.;
Open Access
Published: 14 Sep 2017
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 which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
Subjects by Vocabulary

ACM Computing Classification System: TheoryofComputation_GENERAL ComputerSystemsOrganization_MISCELLANEOUS

Related Organizations
66 references, page 1 of 7

[1] Rivest, R. L., Shamir, A. & Adleman, L. M. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120{126 (1978). URL

[2] Shor, P. W. Algorithms for quantum computation: Discrete logarithms and factoring. In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, 124{134 (IEEE Computer Society, 1994). URL

[3] Beauregard, S. Circuit for Shor's algorithm using 2n + 3 qubits. Quantum Information & Computation 3, 175{185 (2003). URL cfm?id=2011525.

[4] Miller, V. S. Use of elliptic curves in cryptography. In Williams, H. C. (ed.) Advances in Cryptology - CRYPTO '85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings, vol. 218 of Lecture Notes in Computer Science, 417{426 (Springer, 1985). URL

[5] Koblitz, N. Elliptic curve cryptosystems. Mathematics of Computation 48, 203{209 (1987).

[6] Grover, L. K. A fast quantum mechanical algorithm for database search. In Miller, G. L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, 212{219 (ACM, 1996). URL

[7] Grassl, M., Langenberg, B., Roetteler, M. & Steinwandt, R. Applying Grover's algorithm to AES: quantum resource estimates. In Takagi, T. (ed.) Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings, vol. 9606 of Lecture Notes in Computer Science, 29{43 (Springer, 2016). URL

[8] Rostovtsev, A. & Stolbunov, A. Public-key cryptosystem based on isogenies (2006). URL

[9] Couveignes, J.-M. Hard homogeneous spaces (2006). URL https://eprint.iacr. org/2006/291.

[10] Jao, D. & Feo, L. D. Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In Yang, B.-Y. (ed.) Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29 - December 2, 2011. Proceedings, vol. 7071 of Lecture Notes in Computer Science, 19{34 (Springer, 2011). URL

Funded by
Post-quantum cryptography for long-term security
  • Funder: European Commission (EC)
  • Project Code: 645622
  • Funding stream: H2020 | RIA
NWO| Computational number theory in cryptography and cryptanalysis
  • Funder: Netherlands Organisation for Scientific Research (NWO) (NWO)
  • Project Code: 2300163763
NSF| TWC: Option: Medium: Collaborative: Authenticated Ciphers
  • Funder: National Science Foundation (NSF)
  • Project Code: 1314919
  • Funding stream: Directorate for Computer & Information Science & Engineering | Division of Computer and Network Systems
Download from
Other ORP type . 2017
Providers: NARCIS