The week's pick
Random Articles
Reseach Article
Mixed Radix Conversion based RSA Encryption System
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 150 - Number 1 |
| Year of Publication: 2016 |
| Authors: Salifu Abdul-Mumin, Kazeem A. Gbolagade |
10.5120/ijca2016911455
|
Salifu Abdul-Mumin, Kazeem A. Gbolagade . Mixed Radix Conversion based RSA Encryption System. International Journal of Computer Applications. 150, 1 ( Sep 2016), 43-47. DOI=10.5120/ijca2016911455
Abstract
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 me < 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.
References
- Burt Kaliski, ―The Mathematics of the RSA Public-Key Cryptosystem‖, RSA Laboratories. April 9, 2006
- Rivest, R. L.—Shamir, A.—Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of ACM, Vol. 2, pp. 120–126, 1978
- P.W. Shor, Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In IEEE Symp. on Found. of Comp. Sci., p.124-134, 1994
- Paulo Martins, Leonel Sousay, Programmable RNS Lattice-Based Parallel Cryptographic Decryption, IEEE 26th International Conference on Application-specific Systems, Architectures and Processors (ASAP) pp: 149-153, 2015
- F.J. Taylor, ―Residue Arithmetic: A Tutorial with Examples,‖ IEEE Computer Society Press Los Alamitos, CA, USA vol. 17, no. 5, pp. 50-62, May 1984
- K. A. Gbolagade, An Efficient MRC based RNS-to-Binary Converter for the moduli set, {22n+1-1, 2n, 22n-1}, AIMS SA, 2011
- K.A. Gbolagade and S.D. Cotofana, An O(n) Residue Number System to Mixed Radix Technique, IEEE International Symposium on Circuits and Systems (ISCAS 2009), pp. 521-524, Taipei, Taiwan, China, May, 2009.
- H. Siewobr and K.A.Gbolagade, Modulo Operation Free Reverse Conversion in the Moduli Set {22n+1-1, 2n, 22n-1} International Journal of Computer Applications (0975 – 8887) Volume 85 – No 18, January 2014
- Edem K. Bankas, Kazeem A. Gbolagade, A New Efficient RNS Reverse Converter for the 4-Moduli Set, {2n, 2n + 1, 2n − 1, 22n+1 – 1}, International Journal of Computer, Electrical, Automation, Control and Information Engineering Vol:8, No:2, 2014
Index Terms
Keywords