Recursive double-size fixed precision arithmetic

DOI10.1007/978-3-319-42432-3_28MaRDI QIDQ2819221zbMATH OpenOpenAlexFDO

Authors Alexis Breust, Christophe Chabot, Jean-Guillaume Dumas, Laurent Fousse, Pascal Giorgi

Publication date 28 September 2016

Published in Mathematical Software – ICMS 2016 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.0478

Numerical algorithms for computer arithmetic, etc. (65Y04) Packaged methods for numerical algorithms (65Y15)

Abstract: This work is a part of the SHIVA (Secured Hardware Immune Versatile Architecture) project whose purpose is to provide a programmable and reconfigurable hardware module with high level of security. We propose a recursive double-size fixed precision arithmetic called RecInt. Our work can be split in two parts. First we developped a C++ software library with performances comparable to GMP ones. Secondly our simple representation of the integers allows an implementation on FPGA. Our idea is to consider sizes that are a power of 2 and to apply doubling techniques to implement them efficiently: we design a recursive data structure where integers of size 2^k, for k>k0 can be stored as two integers of size 2^{k-1}. Obviously for k<=k0 we use machine arithmetic instead (k0 depending on the architecture).

Recommendations

Cites work

Cited in

(2)

Describes a project that uses

Uses Software

This page was built for publication: Recursive double-size fixed precision arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819221)