### Preprocess-then-NTT Technique and Its Applications to KYBER and NEWHOPE

Shuai Zhou, Haiyang Xue, Daode Zhang, Kunpeng Wang, Xianhui Lu, Bao Li, and Jingnan He

##### Abstract

The Number Theoretic Transform (NTT) provides efficient algorithm for multiplying large degree polynomials. It is commonly used in cryptographic schemes that are based on the hardness of the Ring Learning With Errors problem (RLWE), which is a popular basis for post-quantum key exchange, encryption and digital signature. To apply NTT, modulus q should satisfy that q = 1 mod 2n, RLWE-based schemes have to choose an oversized modulus, which leads to excessive bandwidth. In this work, we present “Preprocess-then-NTT (PtNTT)” technique which weakens the limitation of modulus q, i.e., we only require q = 1 mod n or q = 1 mod n/2. Based on this technique, we provide new parameter settings for KYBER and NEWHOPE (two NIST candidates). In these new schemes, we can reduce public key size and ciphertext size at a cost of very little efficiency loss.

Note: Revise the references.

Available format(s)
Publication info
Published elsewhere. Inscrypt 2018
Keywords
NTTPreprocess-then-NTTKyberNewHopeRing LWEModule LWE
Contact author(s)
zhoushuai @ iie ac cn
haiyangxc @ gmail com
History
2020-08-01: last of 2 revisions
See all versions
Short URL
https://ia.cr/2018/995

CC BY

BibTeX

@misc{cryptoeprint:2018/995,
author = {Shuai Zhou and Haiyang Xue and Daode Zhang and Kunpeng Wang and Xianhui Lu and Bao Li and Jingnan He},
title = {Preprocess-then-NTT Technique and Its Applications to KYBER and NEWHOPE},
howpublished = {Cryptology ePrint Archive, Paper 2018/995},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/995}},
url = {https://eprint.iacr.org/2018/995}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.