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...
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 |
Similar Items
-
Improving the Accuracy of the Fast Inverse Square Root by Modifying Newton–Raphson Corrections
by: Cezary J. Walczyk, et al.
Published: (2021-01-01) -
Magic Square and Arrangement of Consecutive Integers That Avoids <i>k</i>-Term Arithmetic Progressions
by: Kai An Sim, et al.
Published: (2021-09-01) -
The Friction Reducing Effect of Square-Shaped Surface Textures under Lubricated Line-Contacts—An Experimental Study
by: Ping Lu, et al.
Published: (2016-07-01) -
Reciprocal Alternations in Persian
by: Maryam Ghiasvand, et al.
Published: (2019-12-01) -
Emphatic Reciprocal Expressions and Symmetric Verbs in Spanish: An Empirical Analysis
by: Glòria Vázquez, et al.
Published: (2016-10-01)