Graph labeling is an important topic in Graph theory, a branch of Mathematics, having applications in the field of Networks, radio astronomy and cryptography etc. In most of encryption algorithms, words are encrypted as words. But our implementation is based on the algorithm that encrypts words into numbers, with the help of an edge weighted graph. Mapping of certain positive integers to graph elements in such a way that weights of all edges computed as, sum of the labels of all graph elements, are distinct is termed as Antimagic labeling In this paper, we present an algorithm that encrypts words into edge weighted graphs using super-edge antimagic total labeling of Bi-star graph and illustrate with an example.