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

Jung Hee Suk, Jin Seon Youn, Hui Gon Kim, Taek Won Kwon, Jun Rim Choi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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

Original languageEnglish
Title of host publicationISSCS 2005
Subtitle of host publicationInternational Symposium on Signals, Circuits and Systems - Proceedings
Pages355-358
Number of pages4
DOIs
StatePublished - 2005
EventISSCS 2005: International Symposium on Signals, Circuits and Systems - Iasi, Romania
Duration: 14 Jul 200515 Jul 2005

Publication series

NameISSCS 2005: International Symposium on Signals, Circuits and Systems - Proceedings
Volume1

Conference

ConferenceISSCS 2005: International Symposium on Signals, Circuits and Systems
Country/TerritoryRomania
CityIasi
Period14/07/0515/07/05

Fingerprint

Dive into the research topics of 'A parity checker for a large residue numbers based on montgomery reduction method'. Together they form a unique fingerprint.

Cite this