Table 9 Complexity analysis in terms of cumulative circuit depth2 (CCD) and the number of homomorphic multiplications (HMs) for secure approximation division (Algorithm 3).
From: FORESEE: Fully Outsourced secuRe gEnome Study basEd on homomorphic Encryption
Algorithm 3 | CCD | # of HMs |
|---|---|---|
1: Compute |
| d − 1 |
2: Compute |
| C − 2 |
3:For c = 0,1, ⋯, C − 1 | ||
4: For i = 0,1, ⋯, d − 1 | ||
5: Calculate | − | − |
6: end for | ||
7: end for | ||
8: | ||
9: For c = 0,1, ⋯, C − 1 | ||
10: | − | − |
11: For i = 0,1, ⋯, d − 1 | ||
12: | − | − |
13: end for | ||
14: |
| 1 |
15: end for | ||
Total: |
| 2C + d − 3 |