TY  - JOUR
T1  - Application of RNS to Huffman’s Method of Secured Data Encryption Algorithm
AU - Weyori, B.A. AU - Akobre, S. AU - Armah, G.K. 
JO  - International Journal of Soft Computing
VL  - 4
IS  - 5
SP  - 197
EP  - 200
PY  - 2009
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2009.197.200
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2009.197.200
KW  - Data encryption
KW  -Huffman’s method
KW  -RNS
KW  -moduli set
KW  -encoder
KW  -decoder
AB  - 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 (2<SUP>n</SUP>-1, 2<SUP>n</SUP>, 2<SUP>n</SUP>+1) moduli set, which is an adaption of the Traditional Huffman&#146;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.
ER  -