Published Paper Details:

Communication between two parties needs to be secured. Data transmission can be protected from intruders if the data is appropriately enciphered. Various algorithms came into existence to address the problem. But, this paper intends to bring the superior methodology to protect the data transmission. This paper presents a key-less "JS algorithm", which readily encrypts and decrypts the data. This algorithm would not produce separate keys and eventually saves much time, memory and cost associated with key generation. The paper has introduced a concept of utilizing certain portion of its own data to create a protective coating from eavesdropper. Selection of appropriate number of rounds (up to 256) as per the security level is a major advantage associated with the algorithm. Overall, the paper tries to secure the data transfer such that it becomes near to impossible for non authorized personnel to encrypt the data. The paper presents the experimental analysis of the data in the later portion.