Created framework for BLISS post-quantum signature algorithm
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.
Added BLISS OIDs in ITA-HSR OID tree
Defined BLISS I and IV parameter sets
Moved mgf1 class to libstrongswan/crypto/mgf1
unit-tests: Added bliss_fft test suite
Implemented bitspender based on the MGF1 mask generator function
Use mgf1_bitspender to generate random secret key
Use mgf1_bitspender in ntru_poly_create_from_seed
unit-tests: Created separate mgf1 test suite
Store and parse BLISS private and public keys in DER and PEM format

Additionally generate SHA-1 fingerprints of raw BLISS subjectPublicKey
and subjectPublicKeyInfo objects.

Some basic functions used by the bliss_public_key class are shared
with the bliss_private_key class.
Started implementing BLISS signature generation
Added support for BLISS-III
Implemented get_byte() method for mgf1_bitspender class

The new get_byte() method returns a pseudo-random byte at a time.
Changed the get_bits() interface to the same interface as get_byte().
Updated the mgf1 unit-tests accordingly.
Implemented Gaussian rejection sampler

The bliss_sampler class uses the mgf1_bitspender as a
pseudo-random source.
Finished BLISS signature generation
unit-tests: created bliss_sign test suite
Store NTT A of BLISS public key a
Skip the unused bits field of the ASN.1 BIT STRING encoding
Created bliss_bitpacker class to encode BLISS signatures