Abstract
With the publication of Peter Shor’s seminal paper that factoring and discrete log computations would be entirely feasible on a quantum computer, and with advances in the building of quantum computers, there has been a focus on what is referred to as “post-quantum cryptography”. Among the most viable candidates for post-quantum cryptography are cryptosystems based on the problem of finding short vectors in lattices. In this chapter we outline briefly why quantum computers can make RSA-type cryptosystems obsolete and how lattices can be used in cryptography. We concentrate on perhaps the best-known lattice system, NTRU, and explain how it is used and why attacks on it still seem computationally infeasible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We will refer to these authors as “HPS” in the text here.
- 2.
We note that some presentations include the multiplication by p as part of the public key h, while the HPS presentation multiplies by p when the ciphertext is produced.
References
D.A. Buell, D.A. Carlson, Y.-C. Chow, K. Culik, N. Deo, R. Finkel, E.N. Houstis, E.M. Jacobson, Z.M. Kedem, J.S. Kowalik, P.J. Kuekes, J.L. Martin, G.A. Michael, N.S. Ostlund, J. Potter, D.K. Pradhan, M.J. Quinn, G.W. Stewart, Q.F. Stout, L. Watson, J. Webb, Report of the summer workshop on parallel algorithms and architectures, Report UMIACS TR-86-1, CS-TR-1625 (Supercomputing Research Center and University of Maryland Institute for Advanced Computer Studies, Lanham MD, 1986)
C.H. Bennett, G. Brassard, Quantum cryptography: public key distribution and coin tossing, in International Conference on Computers, Systems, and Signal, Processing (1984), pp. 175–179
T. Monz, D. Nigg, E. Martinez, M.B.l, P. Schindler, R. Rines, S. Wang, I. Chuang, R. Blatt, Realization of a scalable Shor algorithm, in Science (2016), pp. 1068–1070
P.W. Shor, Algorithms for quantum computation: discrete log and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994), pp. 124–134
J. Hoffstein, J. Pipher, J.H. Silverman, NTRU: a ring-based public key cryptosystem, in Proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III (1998), pp. 267–288
J. Hoffstein, J. Pipher, J.H. Silverman, An Introduction to Mathematical Cryptography (Springer, 2010)
D. Coppersmith, A. Shamir, Lattice attacks on NTRU, in EUROCRYPT, vol. 1233, Lecture Notes in Computer Science, ed. by W. Fumy (1997), pp. 52–61
A.K. Lenstra, H.W. Lenstra Jr., L. Lov, Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515–534 (1982)
The Sage Developers, Sagemath, the Sage Mathematics Software System (Version 9.2) (2020). https://www.sagemath.org
Security Innovation, NTRU PKCS Tutorial (2021). http://www.securityinnovation.com/security-lab/crypto/155.html
J. Hoffstein, J. Pipher, J.M. Schanck, J.H. Silverman, M. Whyte, Z. Zhang, Choosing parameters for NTRUEncrypt, in Topics in Cryptology - CT-RSA 2017, vol. 10159, Lecture Notes in Computer Science, ed. by H. Handschuh (2017)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Buell, D. (2021). Lattice-Based Cryptography and NTRU. In: Fundamentals of Cryptography. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-73492-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-73492-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73491-6
Online ISBN: 978-3-030-73492-3
eBook Packages: Computer ScienceComputer Science (R0)