NTRU prime: reducing attack surface at low cost

D.J. Bernstein, C. Chuengsatiansup, T. Lange, C. van Vredendaal

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

36 Citations (Scopus)


Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems.

This paper (1) proposes NTRU Prime, which tweaks NTRU to use rings without these structures; (2) proposes Streamlined NTRU Prime, a public-key cryptosystem optimized from an implementation perspective, subject to the standard design goal of IND-CCA2 security; (3) finds high-security post-quantum parameters for Streamlined NTRU Prime; and (4) optimizes a constant-time implementation of those parameters. The resulting sizes and speeds show that reducing the attack surface has very low cost.

Post-quantum cryptography Public-key encryption Lattice-based cryptography Ideal lattices NTRU Ring-LWE Security Soliloquy Karatsuba Software implementation Vectorization Fast sorting
Original languageEnglish
Title of host publicationSelected Areas in Cryptography – SAC 2017 - 24th International Conference, Revised Selected Papers
EditorsCarlisle Adams, Jan Camenisch
Place of PublicationBerlin
Number of pages26
ISBN (Electronic)978-3-319-72565-9
ISBN (Print)978-3-319-72564-2
Publication statusPublished - 2017

Publication series

NameLecture Notes in Computer Science


  • Fast sorting
  • Ideal lattices
  • Karatsuba
  • Lattice-based cryptography
  • NTRU
  • Post-quantum cryptography
  • Public-key encryption
  • Ring-LWE
  • Security
  • Software implementation
  • Soliloquy
  • Vectorization


Dive into the research topics of 'NTRU prime: reducing attack surface at low cost'. Together they form a unique fingerprint.

Cite this