A Parity Checker for a Large RNS Numbers Based on Montgomery Reduction Method(Electronic Circuits)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人電子情報通信学会の論文
• 2005-09-01

著者

• Choi Jun

  Faculty Of The School Of Electrical Engineering And Computer Science At Kyungpook National Universit

• Kwon Taek

  Samsung Electronics Device Solution Network

関連論文

• A Parity Checker for a Large RNS Numbers Based on Montgomery Reduction Method(Electronic Circuits)

スポンサーリンク