Modular multiplier by folding Barrett modular reduction

Modular multipliers of medium or small sizes can be implemented by Barrett modular reduction algorithm. In this work, based on the folded Barrett modular reduction algorithm, we propose a two-stage pipelined modular multiplier for residue arithmetic. In terms of Time×Area, the proposed architecture is more efficient than the modular multiplier by present Barrett modular reduction algorithm.