ENHANCING SECURITY THROUGH COMPRESSION, RANDOMIZED ENCRYPTION AND AUTHENTICATION
V. Gopalakrishnan, T. Purusothaman, S. Annadurai and S. Nitin Balaji
Department of computer science and Engineering, Govt College of Technology, Coimbatore, India 641 013
 

Abstract

In recent times the analysis of cryptographic protocols has been getting more attention, and thus the demand for general frameworks for representing cryptographic protocols and their security requirements has been raising. Similarly Communication has become an indispensable part of life. Where there is a need for a good communication medium, there is also a need for the information to be secured along the medium. This paper aims at improving the security of the information over the insecure network by allowing the plaintext to go through the several sequences of steps. First in the compression module, the given plaintext is compressed and is divided into a number of fragments which are then jumbled. The user is provided with two different modes viz. ‘with junk’ and ‘without junk’. In the randomized encryption module, the file is subjected to encryption by selecting an algorithm from a set of symmetric encryption algorithms in a random fashion. This provides an effective alternative to the oft-used multi-algorithm encryption scheme in which the plaintext is subjected to encryption multiple times successively by different algorithms [5]. Finally in the last module, SHA code is appended for the purpose of authentication at the receiving end. In the receiving end, the file is first authenticated using SHA algorithm, decrypted using the corresponding algorithm which was used on the sender’s side, the fragments rearranged in proper order and finally decompressed to get back the original plaintext. The cryptanalysis is thus made difficult by adopting this approach of compression, junk treatment, randomized encryption and authentication.

Keywords: Compression Randomized Encryption,Authentication, Fragmentation, Cryptanalysis.

(Full paper, 316KB )

BibTex