Divisions and Square Roots with Tight Error Analysis from Newton–Raphson Iteration in Secure Fixed-Point Arithmetic

In this paper, we present new variants of Newton–Raphson-based protocols for the secure computation of the reciprocal and the (reciprocal) square root. The protocols rely on secure fixed-point arithmetic with arbitrary precision parameterized by the total bit length of the fixed-point numbers and th...

Full description

Bibliographic Details
Main Authors: Stan Korzilius, Berry Schoenmakers
Format: Article
Language:English
Published: MDPI AG 2023-09-01
Series:Cryptography
Subjects:
Online Access:https://www.mdpi.com/2410-387X/7/3/43