ntt library

Constants

n → const int

q → const int

zetas → const List<int>

Properties

nInv → int

Calculate nInv once: nInv = 256^(q-2) mod q According to PQClean, nInv = 256^{-1} mod q = 3293 for q=3329.

final

Functions

invntt(List<int> a) → List<int>

mod(int a, int m) → int

modAdd(int a, int b, int m) → int

modMul(int a, int b, int m) → int

modPow(int base, int exp, int modulus) → int

modSub(int a, int b, int m) → int

ntt(List<int> poly) → List<int>