Call for Paper - September 2020 Edition
IJCA solicits original research papers for the September 2020 Edition. Last date of manuscript submission is August 20, 2020. Read More

Generalized Information Security and Fault Tolerant based on Redundant Residue Number System

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Idris Abiodun Aremu, Kazeem Alagbe Gbolagade

Idris Abiodun Aremu and Kazeem Alagbe Gbolagade. Generalized Information Security and Fault Tolerant based on Redundant Residue Number System. International Journal of Computer Applications 167(13):43-47, June 2017. BibTeX

	author = {Idris Abiodun Aremu and Kazeem Alagbe Gbolagade},
	title = {Generalized Information Security and Fault Tolerant based on Redundant Residue Number System},
	journal = {International Journal of Computer Applications},
	issue_date = {June 2017},
	volume = {167},
	number = {13},
	month = {Jun},
	year = {2017},
	issn = {0975-8887},
	pages = {43-47},
	numpages = {5},
	url = {},
	doi = {10.5120/ijca2017914563},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Residue number systems bestow a first class means for exceptionally long integer arithmetic. Their carry-free operations make parallel implementations feasible. Some applications involving very long integers, such as information security, rely heavily on fast modulo reductions. Information Security is an extensive issue and covers a huge number of crimes. In its simplest form, it is concerned with making sure that curious people cannot read or modify messages anticipated for other recipients, and Fault-tolerant computing is the art and science of building computing systems that continue to operate adequately in the presence of faults. In this paper, a generalized information security and fault tolerant system using Redundant Residue Number System (RRNS) was proposed, the theoretical result show that our proposed scheme is out performed better compared with the state of the art in term of the computation time and space, called Delay and Area respectively and also provides more security to the data.


  1. Gollmann, Dieter(2010). Computer security Wiley Interdisciplinary Reviews: Computational Statistics, 544-554
  2. Harris, S. (2002). Mike Meyers' Cissp Certification Passport with Cdrom. Osborne/McGraw-Hill.
  3. Jonsson, E. (1996). A quantitative approach to computer security from a dependability perspective. Chalmers University of Technology,.
  4. Meshram, A. D., Sambare, A. S., & Zade, S. D. (2013). Fault tolerance model for reliable cloud computing. International Journal on Recent and Innovation Trends in Computing and Communication, 1(7), 600-603.
  5. Constantinescu, C. (2003). Trends and challenges in VLSI circuit reliability. IEEE micro, 23(4), 14-19.
  6. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: a survey. Computer networks, 38(4), 393-422.
  7. Gbolagade, K. A. (2010). Effective reverse conversion in residue number system processors.
  8. Younes, D., & Steffan, P. (2012, December). A comparative study on different moduli sets in residue number system. In Computer Systems and Industrial Informatics (ICCSII), 2012 International Conference on (pp. 1-6). IEEE.
  9. James, J., & Pe, A. (2015, July). Error correction based on redundant Residue Number System. In Electronics, Computing and Communication Technologies (CONECCT), 2015 IEEE International Conference on (pp. 1-5). IEEE.
  10. Yau, S. S., & Liu, Y. C. (1973). Error correction in redundant residue number systems. IEEE Transactions on Computers, 100(1), 5-11.
  11. Sengupta, Avik, Dalin Zhu, and Balasubramaniam Natarajan (2012). On the performance of redundant residue number system codes assisted STBC design Computing, Networking and Communications (ICNC), International Conference on. IEEE,.
  12. Krishna, H., & Sun, J. D. (1993). On theory and fast algorithms for error correction in residue number system product codes. IEEE Transactions on Computers, 42(7), 840-853.
  13. Siewobr, Hillary, Kazeem A. Gbolagade, and Sorin Cotofana (2014). An efficient residue-to-binary converter for the new moduli set {2 n/2±1, 2 2n+1, 2 n+ 1}.International Symposium on Integrated Circuits (ISIC). IEEE,.
  14. Amusa, K., & Nwoye, E. (2012). Novel algorithm for decoding redundant residue number systems (RRNS) codes. integers, 1, 7.
  15. Krishna, H., Lin, K. Y., & Sun, J. D. (1992). A coding theory approach to error control in redundant residue number systems. I. Theory and single error correction. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 39(1), 8-17.
  16. Bagri, D. S., Statman, J. I., & Gatti, M. S. (2007). Proposed array-based deep space network for NASA. Proceedings of the IEEE, 95(10), 1916-1922.
  17. Tay, T. F., & Chang, C. H. (2016). A non-iterative multiple residue digit error detection and correction algorithm in RRNS. IEEE transactions on computers, 65(2), 396-408.
  18. Bankas, E. K., & Gbolagade, K. A. (2013). A New Efficient FPGA Design of Residue-To-Binary Converter. International Journal of VLSI Design & Communication Systems, 4(6), 1.


Residue Number System (RNS), Redundant Residue Number System (RRNS), Mixed-Radix Conversion (MRC), Chinese Remainder Theorem (CRT)