An O(n) Residue Number System to Mixed Radix Conversion technique

Gbolagade, Kazeem Alagbe; Cotofana, Sorin

doi:10.1109/iscas.2009.5117800

Cited by 24 publications

(23 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[5] Residue Number System (RNS) is an integer number system with the capabilities to support parallel, carry-free addition, borrow-free subtraction and single step multiplication without partial product. These features enable RNS utilization in Digital Signal Processing (DSP) applications such as digital filtering, convolution, fast Fourier transform and image processing [6], [7], [8] However, RNS has not found a wide spread usage in general purpose computing due to the following difficult RNS arithmetic operations: magnitude comparison, sign detection, overflow detection, moduli selection, reverse and forward conversions. [9] The conversion from a conventional number system to a residue number system is referred to as Forward conversion and the conversion from a residue number system to a conventional number system is known as Reverse/Backward conversion which is achieved by using the Chinese Remainder Theorem or Mixed Radix Conversion.…”

Section: Background Of Rnsmentioning

confidence: 99%

Mixed Radix Conversion based RSA Encryption System

Abdul-Mumin¹,

Gbolagade²

2016

IJCA

View full text Add to dashboard Cite

Information security is a critical issue in data communication networks. This is more important in wireless communications due to the fact that the transmitted signal could go beyond the communicating participants. Any person with the right equipment could intercept the transmitted information with ease. It is therefore paramount to encrypt information before transmission to prevent intruders from making meaning to intercepted signals. In this paper, an improved Rivest Shamir Adleman (RSA) cryptosystem based on Residue Number System (RNS) is implemented. There are two stages of encryption. The first stage is the traditional RSA and the second stage is to further encrypt the cypher text obtained from RSA using smaller moduli. The first stage of the decryption process is to obtain a partial result through Mixed Radix Conversion (MRC). The final stage of decryption is the RSA decryption process. This is to allow a message m, for which m e < n to be able to be encrypted. The private key length is also enhanced by adding the moduli set to the RSA private key component. It is observed that the proposed system outperforms the existing algorithm in terms of security.

show abstract

Section: Background Of Rnsmentioning

confidence: 99%

Mixed Radix Conversion based RSA Encryption System

Abdul-Mumin¹,

Gbolagade²

2016

IJCA

View full text Add to dashboard Cite

show abstract

“…There is abundance of research materials on MM, RNS based MM, and its various extensions. A partial list of such papers is [1]- [12]. We have come across limited number of research papers on RNS based BA [13]- [14].…”

Section: Introductionmentioning

confidence: 99%

New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations

Garg

Xiao

2016

IEEE Access

View full text Add to dashboard Cite

In this paper, we derive new computational techniques for residue number systems (RNS) based Barrett algorithm (BA). The focus of the work is an algorithm that carries out the entire computation using only modular arithmetic without conversion to large integers via the Chinese Remainder Theorem (CRT). It also avoids the computationally expensive scaling-rounding operation required in the earlier work. There are two parts to this work. First, we set up a new BA using two constants other than powers of two. Second, a RNS based BA is described. A complete mathematical framework is described including proofs of the various steps in the computations and the validity of results. Third, we present a computational algorithm for RNS based BA. Fourth, the RNS based BA is used as a basis for new RNS based algorithms for MoM and MoE. The applications we are dealing with are in the area of cryptography.

show abstract

“…These features enable RNS utilization in Digital Signal Processing applications, such as digital filtering, convolution, fast Fourier transform and image processing [4]. However, for successful application of RNS, overflow detection must be easy and fast in order not to prevent RNS usage in general purpose computing.…”

Section: Introductionmentioning

confidence: 99%

“…This is because the sum of 50 and 15 which is 65 falls outside the legitimate range and hence there is an overflow in the sum. The traditional overflow detection technique utilizes either the Chinese Remainder Theorem (CRT) [9] or the Mixed Radix Conversion (MRC) [1,4] techniques.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

RNS Overflow Detection by Operands Examination

Siewobr¹,

Gbolagade²

2014

IJCA

View full text Add to dashboard Cite

In this paper, a novel scheme for detecting overflow in Residue Number System (RNS) is presented. A generalized scheme for RNS overflow detection is introduced, followed by a simplified Operands Examination Method for overflow detection for the moduli set . The proposed method detects overflow in RNS addition of two numbers without pre-computing their sum .Moreover, when compared with the best known similar state of the art designs, the proposed scheme requires lesser hardware, eruder htr izre heit epr and is faster.

show abstract

An O(n) Residue Number System to Mixed Radix Conversion technique

Cited by 24 publications

References 13 publications

Mixed Radix Conversion based RSA Encryption System

Mixed Radix Conversion based RSA Encryption System

New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations

RNS Overflow Detection by Operands Examination

Contact Info

Product

Resources

About