Reverse Converter Design For Cryptographic Applications With High Dynamic Range

The Residue Number System (RNS) is the display system that prepares fast and parallel computing. The cryptography systems use vastly of RNS in its applications. In this Research, we consider the proposed 5-moduli set {2^(4n), 2^(4n)+ 1,2^(2n)+ 1,2^n+1,2^n -1}for increasing large dynamic range (DR) RNS efficiently. This moduli set includes of simple and well-formed moduli where can terminate in efficient implementation of the reverse converter, And uses of the New Chinese Remainder Theorem 1(New CRT 1) for deriving its residue to a binary converter namely reverse converter. We introduce simple hardware implementation of its reverse converter, which is mainly constructed of five Carry Save Adders (CSA), a 8n bit modulo 2^(8n) -1 adder, and some of gates. We compare the performance and hardware efficiency of our reverse converter with the reverse converter of the moduli set {2^(8n)+ 1,2^(4n)+ 1,2^(2n)+1,2^n +1,2^n -1}in the same dynamic range, and also we prove that proposed reverse converter gets speed increase and hardware savings of 39 percent, 45 percent respectively.