Over the centuries, information security has become a major issue. Encryption and decryption of data has recently been widely investigated and developed because there is a demand for a stronger encryption and decryption which is very hard for intrusion. Cryptography plays major roles in fulfilment of these demands. Many of researchers have proposed a lot of encryption and decryption algorithms. But most of the proposed algorithms encountered problems such as lack of reduced cost of data and error control mechanisms to maintain the security of data in the communication channel. In this paper, a highly secured data encryption and decryption scheme is proposed to enhance the Huffman"s method. The Residue Number System (RNS) is employed with four moduli set {2 n-1 , 2 n ─1, 2 n +1, 2 n+1 ─1} and two redundant moduli set {2 2n -3, 2 2n +1} for error handling using the concept of the traditional Huffman"s algorithm, where the frequency of occurrences of each character are used to generate binary codes. The proposed scheme allows for unreadable encrypted set of bits, except the intended recipient with the right moduli set can decrypt it, reduced cost of both data transmission and storage, and error detection and correction. General TermsInformation Security, Number System, and Compression Algorithm.