moose
moose copied to clipboard
Implement more efficient Replicated Square root
In https://github.com/tf-encrypted/moose/pull/1051, we have implemented an initial implementation of square root using log2
and pow2
. Instead we would you to implement the algorithm described in the whitepaper which is similar to Liedel’s algorithm
.
FYI there was a breakdown of work required for this in #563