@@ -18,8 +18,7 @@ For the implementation we have implemented support packages which can be reused:
because they improve the performance of the scheme, and everything still works.
2. In the homomorphic encryption scheme, we need to choose a random subset S. We do this by shuffling a list containing the numbers [1,...,n]
and then choosing the k first numbers in the list, where k is a random integer in the range [1,...,n). This ensures we always add some
noise to the encryption.
and then choosing the k first numbers in the list, where k is a random integer in the range [1,...,n). This ensures we always add some noise to the encryption.
