@inproceedings{257cb95657734d00ad2517d9fe3d1b69,
title = "A parity checker for a large residue numbers based on montgomery reduction method",
abstract = "Fast and simple algorithm of a parity checker for a large residue numbers is presented. A new set of RNS moduli with 2r- (2 1† 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 CRTbased 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",
author = "Suk, {Jung Hee} and Youn, {Jin Seon} and Kim, {Hui Gon} and Kwon, {Taek Won} and Choi, {Jun Rim}",
year = "2005",
doi = "10.1109/ISSCS.2005.1509927",
language = "English",
isbn = "0780390296",
series = "ISSCS 2005: International Symposium on Signals, Circuits and Systems - Proceedings",
pages = "355--358",
booktitle = "ISSCS 2005",
note = "ISSCS 2005: International Symposium on Signals, Circuits and Systems ; Conference date: 14-07-2005 Through 15-07-2005",
}