@article{MAKHILLIJSC20094520987,
    title = {Application of RNS to Huffman’s Method of Secured Data Encryption Algorithm},
    journal = {International Journal of Soft Computing},
    volume = {4},
    number = {5},
    pages = {197-200},
    year = {2009},
    issn = {1816-9503},
    doi = {ijscomp.2009.197.200},
    url = {https://makhillpublications.co/view-article.php?issn=1816-9503&doi=ijscomp.2009.197.200},
    author = {B.A.,S. and},
    keywords = {Data encryption,Huffman’s method,RNS,moduli set,encoder,decoder},
    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 (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.}
    }