Efficient random number generator using novel modulo 2n-2k-1 adder for RNS

Modulo adder is the key component in the residue number system. In this paper a novel modulo 2ⁿ - 2^k - 1 adder is designed and implemented to generate random numbers for use in cryptographic applications. The modulus used in this paper is of the form 2ⁿ - 2^k - 1 (1≤ k ≤ n-2), which is best suitable for multichannel RNS processing. The modulo 2ⁿ - 2^k - 1 adder is divided into four modules the pre processing, the carry generation, the carry modification and the sum calculation module. In the proposed modulo 2ⁿ - 2^k - 1 adder, twice carry correction technique is used which reduces area and delay compared with same type of modulo adder with traditional structure.