@@ -15,7 +15,7 @@ For the implementation we have implemented support packages which can be reused:

...

@@ -15,7 +15,7 @@ For the implementation we have implemented support packages which can be reused:

### Notes on implementation.

### Notes on implementation.

1. For the security parameters we choose 200-bit p, 10^6-bit q, 40-bit r and 1000 elements in the public key. We choose those values

1. For the security parameters we choose 200-bit p, 10^6-bit q, 40-bit r and 1000 elements in the public key. We choose those values

because they improve the performance of the scheme, and everything still works.

because they improve the performance of the scheme. These parameters guarantee that we decrypt the result after evaluating the blood compatibility function.

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]

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.