Conference paper Open Access

NTTRU: Truly Fast NTRU Using NTT

Lyubashevsky , Vadim; Seiler, Gregor

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Lyubashevsky , Vadim</dc:creator>
  <dc:creator>Seiler, Gregor</dc:creator>
  <dc:description>We present NTTRU -- an IND-CCA2 secure NTRU-based key encapsulation scheme that uses the number theoretic transform (NTT) over the cyclotomic ring Z7681[X]/(X768−X384+1)Z7681[X]/(X768−X384+1) and produces public keys and ciphertexts of approximately 1.251.25 KB at the 128128-bit security level. The number of cycles on a Skylake CPU of our constant-time AVX2 implementation of the scheme for key generation, encapsulation and decapsulation is approximately 6.46.4K, 6.16.1K, and 7.97.9K, which is more than 30X, 5X, and 8X faster than these respective procedures in the NTRU schemes that were submitted to the NIST post-quantum standardization process. These running times are also, by a large margin, smaller than those for all the other schemes in the NIST process. We also give a simple transformation that allows one to provably deal with small decryption errors in OW-CPA encryption schemes (such as NTRU) when using them to construct an IND-CCA2 key encapsulation.</dc:description>
  <dc:subject>public-key cryptography / NTRU</dc:subject>
  <dc:subject>Lattice Cryptography, AVX2</dc:subject>
  <dc:title>NTTRU: Truly Fast NTRU Using NTT</dc:title>
Views 67
Downloads 50
Data volume 32.7 MB
Unique views 65
Unique downloads 49


Cite as