Title: Efficient random number generator using novel modulo 2<sup>n</sup>-2<sup>k</sup>-1 adder for RNS
Abstract: Modulo adder is the key component in the residue number system. In this paper a novel modulo 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> - 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup> - 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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> - 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup> - 1 (1≤ k ≤ n-2), which is best suitable for multichannel RNS processing. The modulo 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> - 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup> - 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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> - 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup> - 1 adder, twice carry correction technique is used which reduces area and delay compared with same type of modulo adder with traditional structure.
Publication Year: 2016
Publication Date: 2016-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot