Beside refactoring the FFT transformation has been adapted following [18] to avoid bit-reverse calls. We also reduced the number of InvFFT calls (due to linearity) resulting in factor 2 speed-ups (in total) for the same parameter sets (see below for the reference implementation). Error recovery does not use rounding functions from the C math library any more. Instead it only relies on shifts and elementary operations in constant time. During encryption we add small independently sampled uniform random polynomials (t bits per coefficient) to the public key such that it is uniform random in Rq. The security proof thus also holds for compressed public keys. Furthermore, the secret key size has been reduced. The secret key polynomials are now generated from the secret seed during decryption rather than storing the corresponding polynomials.