denozord/strongswan-ext
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Implemented Number Theoretic Transform using the FFT algorithm

Browse Source 
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.
This commit is contained in:
Andreas Steffen
2014-11-29 14:51:14 +01:00
parent 9d5b91d198
commit 8c751b6119
8 changed files with 869 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/libstrongswan/plugins/bliss/Makefile.am
+3 -1
View File
@@ -14,6 +14,8 @@ endif
libstrongswan_bliss_la_SOURCES = \
bliss_plugin.h bliss_plugin.c \
bliss_private_key.h bliss_private_key.c \
bliss_public_key.h bliss_public_key.c
bliss_public_key.h bliss_public_key.c \
bliss_fft.h bliss_fft.c \
bliss_fft_params.h bliss_fft_params.c
libstrongswan_bliss_la_LDFLAGS = -module -avoid-version