A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Randomization of Arithmetic Over Polynomial Modular Number System
2019
2019 IEEE 26th Symposium on Computer Arithmetic (ARITH)
The Polynomial Modular Number System (PMNS) is an integer number system designed to speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple B = (p, n, , ⇢, E) where E 2 Z[X] and E( ) ⌘ 0 (mod p). In a PMNS, an element a of Z/pZ is represented by a polynomial A such that: A( ) ⌘ a (mod p), deg A < n and k Ak 1 < ⇢. In [6], the authors mentioned that PMNS can be highly redundant but they didn't really take advantage of this possibility. In this paper we use, for the
doi:10.1109/arith.2019.00048
dblp:conf/arith/DidierDMMV19
fatcat:coindfhgjjfp3e6fzpw4asd7mm