Implemented Number Theoretic Transform using the FFT algorithm

By pre-multiplying the input arrays with a linear phase the fast multiplication via FFT and inverse FFT computes a negative wrapped convolution corresponding to a modulus of x^n+1.
2014-11-29 14:51:14 +01:00
parent 9d5b91d198
commit 8c751b6119
8 changed files with 869 additions and 3 deletions
@@ -15,7 +15,7 @@

 /**
 * @defgroup bliss_private_key bliss_private_key
- * @{ @ingroup gmp_p
+ * @{ @ingroup bliss_p
 */

 #ifndef BLISS_PRIVATE_KEY_H_