Table 1:
Comparison of secure d-dimensional matrix multiplication algorithms
| Methodology | Number of ciphertexts | Complexity | Required depth |
|---|---|---|---|
| Naive method | d2 | O(d3) | 1 Mult |
| Halevi-Shoup [25] | d | O(d2) | 1 Mult |
| Ours | 1 | O(d) | 1 Mult + 2 CMult |
Official websites use .gov
A
.gov website belongs to an official
government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you've safely
connected to the .gov website. Share sensitive
information only on official, secure websites.