Abstract
NTRU is a new public key cryptosystem proposed at Crypto 96 by Hoffstein, Pipher and Silverman from the Mathematics department of Brown University. It attracted considerable attention, and is being advertised over the Internet by NTRU Cryptosystems. Its security is based on the difficulty of analyzing the result of polynomial arithmetic modulo two unrelated moduli, and its correctness is based on clustering properties of the sums of random variables. In this paper, we apply new lattice basis reduction techniques to cryptanalyze the scheme, to discover either the original secret key, or an alternative secret key which is equally useful in decoding the ciphertexts.
Chapter PDF
References
J. Hoffstein, J. Pipher and J. H. Silverman, “NTRU: A new high speed public key cryptosystem,” Manuscript, August 30, 1996; presented at rump session of Crypto 96.
J. Hoffstein, J. Pipher and J. H. Silverman, private communications, October 1996 and January 1997.
A. K. Lenstra, H. W. Lenstra and L. Lovasz, “Factoring Polynomials with Integer Coefficients,” Matematische Annalen 261 (1982), 513–534.
C. P. Schnorr, “A hierarchy of polynomial time lattice basis reduction algorithms,” Theoretical Computer Science 53 (1987), 201–224.
C. P. Schnorr, “Block reduced lattice bases and successive minima,” Combinatorics, Probability and Computing 3 (1994), 507–522.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppersmith, D., Shamir, A. (1997). Lattice Attacks on NTRU. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive