A parity checker for a large residue numbers based on Montgomery reduction method

Fast and simple algorithm of a parity checker for a large residue numbers is presented. A new set of RNS moduli with 2^r- (2^l± 1) form for fast modular multiplication is proposed. The proposed RNS moduli has a large dynamic range for a large RNS number. The parity of a residue number can be checked by the Chinese remainder theorem (CRT). A CRT-based parity checker is simply organized by the Montgomery reduction method (MRM), implemented by using multipliers and the carry-save adder array. We present a fast parity checker with minimal hardware processed in three clock cycles for 32-bit RNS modulus set.