[Resource Topic] 2018/229: Optimizing polynomial convolution for NTRUEncrypt

Welcome to the resource topic for 2018/229

Optimizing polynomial convolution for NTRUEncrypt

Authors: Wei Dai, William Whyte, Zhenfei Zhang


NTRUEncrypt is one of the most promising candidates for quantum-safe cryptography. In this paper, we focus on the NTRU743 paramter set. We give a report on all known attacks against this parameter set and show that it delivers 256 bits of security against classical attackers and 128 bits of security against quantum attackers. We then present a parameter-dependent optimization using a tailored hierarchy of multipli- cation algorithms as well as the Intel AVX2 instructions, and show that this optimization is constant-time. Our implementation is two to three times faster than the reference implementation of NTRUEncrypt.

ePrint: https://eprint.iacr.org/2018/229

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .