Cryptography is a subject which deals with the secret transmission of data between two parties. In data transmission, messages are being sent between two parties, should be of small size so that they occupy less space. So data compression plays a vital role in data transmission. Data compression involves encoding of information using fewer bits than the original representation. Compression algorithms reduce the redundancy in data representation to decrease the storage required for that data.

UNICODE is a latest technology which represents characters from different scripting languages in the world. The latest version of UNICODE (Version: 6.3) consists of more than 110,187 characters covering 100 scripts.

In the proposed algorithm, HUFFMAN CODING is used to reduce the size of the original data. UNICODE is used to convert raw bits into some meaningful characters. BINARY TREE is used to shuffle the UNICODE characters. This paper introduces a new technique for cryptography by using UNICODE, BINARY TREES and HUFFMAN CODING.

HUFFMAN CODING, UNICODE, BINARY TREE, compression, shuffling.