| License: Publishing license for publications including print on demand PDF - Accepted Version (383kB) |
- URN to cite this document:
- urn:nbn:de:bvb:355-epub-235630
- DOI to cite this document:
- 10.5283/epub.23563
Alternative links to fulltext:Publisher
Abstract
The square root is an important mathematical primitive whose secure, efficient, distributed computation has so far not been possible. We present a solution to this problem based on Goldschmidt's algorithm. The starting point is computed by linear approximation of the normalized input using carefully chosen coefficients. The whole algorithm is presented in the fixed-point arithmetic framework of ...
Owner only: item control page
Download Statistics