Abstract—Residue Number Systems (RNS) are naturally considered as an interesting candidate to provide efficient arithmetic for implementations of cryptosystems such as RSA, ECC ...
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplic...
—Reproducibility is the ability to obtain bitwise identical results from different runs of the same program on the same input data, regardless of the available computing resource...
Abstract—This work introduces an approach to the computerassisted implementation of mathematical functions geared toward special functions such as those occurring in mathematical...
—Automated reasoning tools often provide little or no support to reason accurately and efficiently about floating-point arithmetic. As a consequence, software verification sys...