Search in Medwell
 
 
International Journal of Soft Computing
Year: 2009 | Volume: 4 | Issue: 5 | Page No.: 197-200
Application of RNS to Huffman’s Method of Secured Data Encryption Algorithm
B.A. Weyori , S. Akobre and G.K. Armah
 
Abstract: Data encryption is very important to the security of information or valuable data. The need for highly secured communication through a transmission medium is of paramount interest, recognizing the fact that most of our business and personal matters are involved. A new highly secured data encryption technique is proposed in this study. The residue number system has been effectively applied to data encryption with (2n-1, 2n, 2n+1) moduli set, which is an adaption of the Traditional Huffman’s algorithm of encryption of data, where the frequency of occurrences are used to generate binary codes. This proposed algorithm will lead to an unreadable encrypted set of bits; except for the decoder with the moduli set can decrypt it.
 
How to cite this article:
B.A. Weyori, S. Akobre and G.K. Armah, 2009. Application of RNS to Huffman’s Method of Secured Data Encryption Algorithm. International Journal of Soft Computing, 4: 197-200.
URL: http://medwelljournals.com/abstract/?doi=ijscomp.2009.197.200