Preprocess-then-NTT technique and its applications to Kyber and NewHope

• Main Authors: ZHOU, Shuai, XUE, Haiyang, ZHANG, Daode, WANG, Kunpeng, LU, Xianhui, LI, Bao, HE, Jingnan
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2018
• Subjects: NTT; Preprocess-then-NTT; Kyber; NewHope; Ring Learning With Errors; Module Learning With Errors; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/9199; https://ink.library.smu.edu.sg/context/sis_research/article/10204/viewcontent/preprocess.pdf
• Institution: Singapore Management University

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 , 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 or . 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.