PMNS revisited for consistent redundancy and equality test

ePrint Report: PMNS revisited for consistent redundancy and equality test

Fangan Yssouf Dosso, Alexandre Berzati, Nadia El Mrabet, Julien Proy

The Polynomial Modular Number System (PMNS) is a non-positional number system for modular arithmetic. A PMNS is defined by a tuple $(p, n, \gamma, \rho, E)$, where $p$, $n$, $\gamma$ and $\rho$ are positive non-zero integers and $E\in\mathbb{Z}_{n}[X]$ is a monic polynomial such that $E(\gamma) \equiv 0 \pmod p$.
The PMNS is a redundant number system. In~\cite{rando-pmns-arith26}, Didier et al. …

defined eprint report equality modular non redundancy report system test