Paper 2021/054

The Cost of IEEE Arithmetic in Secure Computation

David W. Archer, Shahla Atapoor, and Nigel P. Smart


Programmers are used to the rounding and error properties of IEEE double precision arithmetic, however in secure computing paradigms, such as provided by Multi-Party Computation (MPC), usually a different form of approximation is provided for real number arithmetic. We compare the two standard variants using for LSSS-based MPC, with an implementation of IEEE compliant double precision using binary circuit-based MPC. We compare the relative performance, and conclude that the addition cost of IEEE compliance maybe too great for some applications. Thus in the secure domain standards bodies may wish to examine a different form of real number approximations.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. LatinCrypt 2021
Contact author(s)
dwa @ galois com
shahla atapoor @ kuleuven be
nigel smart @ kuleuven be
2021-07-08: last of 2 revisions
2021-01-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {David W.  Archer and Shahla Atapoor and Nigel P.  Smart},
      title = {The Cost of IEEE Arithmetic in Secure Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2021/054},
      year = {2021},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.