ENCRYPTION BASED ON MATRIX TRANSFORMATION TECHNIQUE Sagar Suryavanshi 1 , Jasmin Patil 2 ,Deepali Pawaskar 3 , Prof. Asmita Deshmukh 4 1,2,3 B.E Student , 4 Assistant Professor , Computer Engineering Department, KCCEMSR, Thane, India 1 suryavanshisagar19@gmail.com, 2 deepalipawaskar123@gmail.com 3 jasminishwarpatil@gmail.com, 4 asmitadeshmukh7@gmail.com Abstract - Cryptography is one way to transfer secure information over unsecure network such as Internet. In this paper we are proposing a safe method to transmit data over Internet. In our application, the data sent to a remote host is encrypted first using encryption key then the data is sent to the destination machine. We are performing matrix transformations which are based on circular queue techniques and random functions. At the sender side the first step is to convert the original message into an image, and then perform various transformations on image matrix randomly such as circular left shift, circular right shift and reverse. Keywords Encryption, Decryption, Matrix Scrambling, Circular Queue. I. INTRODUCTION Due to rapid growth of Internet, information tide brings about great economic and social benefit along with which the use of this technology has increased. However, Internet confronts many safety problems. The problems include network attack, hacking, interception of important information and tampering it which is a threat to Internet. Information security is a major concern of our society. The solution for secure transmission of data over network is cryptography. Cryptography is used to convert the plain text to encode or make unreadable form of text. The sensitive data is encrypted on the sender side using an encryption key then it is sent to the destination, At the receiver side, the data is decrypted using an algorithm and decryption key as shown in “Figure 1”. After the decryption process the message is converted back to original format from encrypted format. There are some standard methods which are used with cryptography such as private-key encryption, public-key encryption, digital signature, and hash functions. This paper will put forward a safe method of data transmission to tackle the security problem. It proposes a new technique on matrix scrambling which will be based on random function, shifting and reversing techniques of circular queue. It will be able to resist all kinds of cryptanalytic, statistical attacks. II. RELATED WORK The queue transformation based digital image encryption algorithm proposed by F.Y. LI Min[1], which works efficiently with low time complexity compared to Yongwei et al[2]. However, it still has some shortcomings. Firstly, the algorithm signifies some certain regularity. In this algorithm one random element (i,j) is selected from the matrix and cyclic shifted leftwards and rightwards based on the position in the matrix. This makes encryption output periodic which makes the algorithm vulnerable to attacks. Singh and Gilhorta[3] proposed encrypting a word of text to a floating point number that lies in the range of 0 and 1. The floating point number is then converted into a binary number and after that one time key is used to encrypt the binary number. III. PROPOSED TECHNIQUE In this paper, we propose an efficient digital encryption algorithm based on matrix scrambling technique which is based on random function, shifting and reversing techniques of circular queue, with efficient time complexity. A. Encryption Algorithm The plaintext chosen is arranged into a Bi-directional circular Queue data structure .In the matrix A of order m × n. Input an integer parameter, w, as the count of operations, say, the time of transformation we made to matrix. To some certain degree, this parameter represents the intensity of the encryption. Figure 1: Encryption and Decryption methods with a secure channel for key exchange 191 International Journal of Engineering Research & Technology (IJERT) www.ijert.org ICONECT' 14 Conference Proceedings