An efficient parity detection technique using the two-moduli set {2h-1,2h+1}

Authors:
Chien-Yuan Chen
Affiliations:
I-Shou University, Department of Information Engineering, Kaohsiung County, Kaohsiung 840, Taiwan
Venue:
Information Sciences: an International Journal
Year:
2006

Citing 4
Cited 1

Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding

IEEE Transactions on Computers
Computer arithmetic algorithms

Computer arithmetic algorithms
A Novel Division Algorithm for the Residue Number System

IEEE Transactions on Computers - Special issue on computer arithmetic
A Full RNS Implementation of RSA

IEEE Transactions on Computers

An efficient design of residue to binary converter for four moduli set (2n-1,2n+1,22n-2,22n+1-3) based on new CRT II

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Lu and Chiang used both the table lookup and fractional number approaches to discover the parity of an RNS number. To eliminate the need for table space and time for computing fractions, a two-moduli set {2^h-1,2^h+1} is used to speed up the technique proposed by Lu and Chiang. Based on this modified two-moduli set, it is found that the parity of an RNS number X=(x"1,x"2) is x"1+x"2mod42 if x"1=x"2. On the contrary, if x"1