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

Author

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

Author_Institution

Sch. of Electr. Eng. & Comput. Sci., Kyungbook Nat. Univ., Daegu, South Korea

Volume

1

fYear

2005

fDate

14-15 July 2005

Firstpage

355

Abstract

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.

Keywords

adders; multiplying circuits; parity check codes; residue number systems; 32 bit; Chinese remainder theorem; Montgomery reduction method; RNS moduli; RNS number; carry-save adder array; dynamic range; fast modular multiplication; large residue number; parity checker; three clock cycle; Arithmetic; Cathode ray tubes; Clocks; Computer science; Cryptography; Dynamic range; Graphics; Hardware; Read only memory;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Circuits and Systems, 2005. ISSCS 2005. International Symposium on

Print_ISBN

0-7803-9029-6

Type

conf

DOI

10.1109/ISSCS.2005.1509927

Filename

1509927