Lattice attacks on NTRU

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1233, Issue , 1997, Pages 52-61

  Coppersmith, Don ^a   Shamir, Adi ^b  

^a IBM RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

BROWN UNIVERSITY; CIPHERTEXTS; CLUSTERING PROPERTIES; LATTICE BASIS REDUCTION; POLYNOMIAL ARITHMETIC; PUBLIC KEY CRYPTOSYSTEMS; SECRET KEY; SUMS OF RANDOM VARIABLES;

CRYPTOGRAPHY;

EID: 84957355408     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_5     Document Type: Conference Paper

References (5)

1. 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.
2. J. Hoffstein, J. Pipher and J. H. Silverman, private communications, October 1996 and January 1997.
3. A. K. Lenstra, H. W. Lenstra and L. Lovasz, “Factoring Polynomials with Integer Coefficients,” Matematische Annalen 261 (1982), 513-534.
4. C. P. Schnorr, “A hierarchy of polynomial time lattice basis reduction algorithms,” Theoretical Computer Science 53 (1987), 201-224.
5. C. P. Schnorr, “Block reduced lattice bases and successive minima,” Combinatorics, Probability and Computing 3 (1994), 507-522.