Go to content
UR Home

Secure Distributed Computation of the Square Root and Applications

URN to cite this document:
urn:nbn:de:bvb:355-epub-235630
DOI to cite this document:
10.5283/epub.23563
Liedel, Manuel
Date of publication of this fulltext: 30 Mar 2012 06:18


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 ...

plus


Owner only: item control page
  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons