performance. t = f[j+1] f[j+1] = fieldAdd(t, flen[j+1]) flen[j+1] = fieldMontgomeryMulSu(zeta, flen[j+1], t) } } } for i := range f { f[i] = fieldMontgomeryMul(f[i], 16382) // 16382 = 256⁻¹ * R mod q } return ringElement(f) } // nttMul multiplies two nttElements. func nttMul(a, b nttElement) (p nttElement) { for i := range p { p[i] = fieldMontgomeryMul(a[i], b[i]) } return p } // sampleNTT samples an nttElement uniformly at random from the seed rho and the // indices s and r. It implements Step 3 of...