Commit 6f3b5b97 authored by Anders Jensen Løvig's avatar Anders Jensen Løvig
Browse files

Update README.md

parent b1a1f1d2
......@@ -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.
## Requirements
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment