International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 167 - Number 13 |
Year of Publication: 2017 |
Authors: Idris Abiodun Aremu, Kazeem Alagbe Gbolagade |
10.5120/ijca2017914563 |
Idris Abiodun Aremu, Kazeem Alagbe Gbolagade . Generalized Information Security and Fault Tolerant based on Redundant Residue Number System. International Journal of Computer Applications. 167, 13 ( Jun 2017), 43-47. DOI=10.5120/ijca2017914563
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.