Once you have finished constructing DS (Missing: #1, #6 ) and KEM (Ready!), construct the AEK example Party 1 / Party 2.

On the Verification method of the Digital Signature, you need to check if ||(s1,s2)|| < B to decide whether the signature is accepted or not.

1. Find out what this means.
2. Actually implement this.

On each function add the proper calls to start calculating how much time you are spending on each step. This will help us find out where we can start optimizing.

Currently on the DS, we are assuming the message itself is already hashed. We must do the following:

1. Properly hash a message
2. Include a random nonce with message hashing (otherwise security can be compromised)

This is purely meant for modularity and ease of development.

This will allow us to focus our time in whatever really needs to be optimized.

There is leftover code from Prest's IBE repurposed code that is not used. Thus, we need to remove it.

On each function add the proper calls to start calculating how much time you are spending on each step. This will help us find out where we can start optimizing.

This is Needed for H1 and H2 Hash Functions

Measure Timing for NewHope KEX.

On the KEM we are producing f,g using the already defined RandomPolyFixedSqNorm.
Just double-check that it is in fact producing proper numbers.
Otherwise use the permutation idea presented on the paper, it might actually be faster in the end.

This is purely meant for modularity and ease of development.