55
Views
2
CrossRef citations to date
0
Altmetric
Section A

An improved Chen's parity detection technique for the two-moduli set

&
Pages 938-942 | Received 03 Nov 2008, Accepted 20 Apr 2010, Published online: 11 Jan 2011

References

  • Bajard , J.-C. and Imbert , L. 2004 . Brief contributions: A full RNS implementation of RSA . IEEE Trans. Comput. , 53 ( 6 ) : 769 – 774 .
  • Chen , C.-Y. 2006 . An efficient parity detection technique using the two-moduli set . Inf. Sci. , 76 ( 22 ) : 3426 – 3430 .
  • Koren , I. 1993 . Computer Arithmetic Algorithms , Englewood Cliffs, NJ : Prentice-Hall .
  • Lu , M. and Chiang , T.-S. 1992 . A novel division algorithm for the residue number system . IEEE Trans. Comput. , 41 ( 8 ) : 1026 – 1032 .
  • Shang , M. , JianHao , H. , Lin , Z. and Xiang , L. 2008 . An efficient RNS parity checker for moduli set and its applications . Sci. China Ser. F Inf. Sci. , 51 ( 10 ) : 1563 – 1571 .
  • Szabo , N. and Tanaka , R. 1967 . Residue Arithmetic and Its Applications to Computer Technology , New York : McGraw-Hill .
  • Van Vu , T. 1985 . Efficient implementations of Chinese remainder theorem for sign detection and residue decoding . IEEE Trans. Comput. , 34 : 646 – 651 .
  • Yang , J.-H. , Chang , C.-C. and Chen , C.-Y. 2004 . A high-speed division algorithm in residue number system using parity-checking technique . Int. J. Comput. Math. , 81 ( 6 ) : 775 – 780 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.