“…In this RNS, any integer 0 ≤ X < M ≤ Q s i=1 mi can be uniquely and unambiguously represented by a residue sequence (r1, r2, ..., rs), where ri = X mod mi represents the residue of X with respect to mi, 0 ≤ ri < mi. Reversely, in this RNS, given an s-tuple residue sequence (r1, r2, ..., rs) with 0 ≤ ri < mi, i = 1, ..., s, according to the Chinese reminder theorem (CRT) [15], there exists one and only one integer 0 ≤ X < M satisfying ri = X mod mi. In other words, if (r1, r2, ..., rs) conveys a message X, it can be recovered uniquely and unambiguously with the aid of, for example, the Chinese reminder theorem.…”