tteras/strongswan - tteras' strongSwan tree

	Commit message (Collapse)	Author	Age	Files	Lines
*	Implemented Number Theoretic Transform using the FFT algorithm	Andreas Steffen	2014-11-29	1	-0/+71
	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.