Image Security Using Linear Feedback Shift Register
Image Security Using Linear Feedback Shift Register
Image Security Using Linear Feedback Shift Register
Abstract- Encrypting data is a way to protect the data or to prevent Here we are introducing a new method for encryption using a
the unauthorized access of data by others and these data can be Linear Feedback Shift Register[4], for encrypting the data before
text, image audio, video or anything. In order to protect data from it is transferred to the communication channel.
unauthorized access a new concept is introduced and this is based
on linear feedback shift register method. In this method two step
encryption is provided to give more security to the data. The
encrypted image can be decoded in the decryption stage. In the II. LITERATURE SURVEY
encryption stage the LFSR will generate random numbers to Many researchers are introduced various techniques for
reorder positions of each pixels in the row of the image . After row encryption. These encryption methods have many applications in
encryption, column need to be encrypted by again generating the real world applications such as the medical imaging , military
random numbers using LFSR to reorder each pixels in the column communication, internet communication and so on.
of the image . Then we use XOR operation to shuffle all pixels to get
the final encrypted image. To decrypt the image , reverse operation
of encryption is performed . First step in the decryption process is Sivakumar et al [2] proposed a novel approach for image
XOR execution and then decrypt the column encrypted image and encryption using scan based pixels position permutation and
finally decrypting row encrypted image to reconstruct the original random key stream. Namitha Tiwari [6] proposes a method
image. which uses using two levels of encryption for encrypting an
image. Two different techniques are used for this proposed
KeywordsLinear Feedback shift Register, Encryption, Decryption, encryption scheme. Mazumdar et al [7] proposes an efficient and
XOR, Random generator. secure method to modify the plain text into an encoded cipher
text. This can provide about 80-85% data security as decoding of
I. INTRODUCTION data involves inverting the feedback function produced by linear
Today, the demand of internet has made the transmission of feedback shift register or generating the binary sequence which
digital media much easier and faster. Open nature of the internet, will help in retrieving the data after some recombination
risks of illegitimate accessing and unauthorized tempering and operation. Another method for image encryption is proposed by
access with transmitted data is increased day by day. Protection Huang et al.[3], proposes a chaotic system which is adopted as
of secret information from unauthorized users in a public the fundamental base and combined with row, column shuffling,
network has become an important issue in the internet world. As and gray-level encryption.
the cyber crimes are increased day by day, network security
alone is not sufficient for securing data. Security is measured as a III. PROPOSED SYSTEM
critical factor which is to be taken care of while transferring The proposed system has got many advantages such as it
confidential data on the Internet. Since text, images, audio, video reduces the risk involved in the implementation of other
are the part of digital data that are transferred over open public encryption algorithms. It also provides more security than other
network so there is need to protect this digital data. From the last methods as it generates the random numbers using the random
few decades, various methods have been developed and number generator[5]. Random generators use XOR operation to
implemented to impose security in various types of applications produce a random or periodic sequences. Previous sequence is
in the network. given as the input bit to the linear function.
guess the next number in the sequence, even if he/she have some
idea about some numbers in the generated sequence.
b) Encryption
The first phase of the encryption stage , is to load the color image Fig .1 Different stages in Encryption
which needs to be encrypted . Then we need to generate the
random numbers used for reordering the row wise pixel values of c) Decryption
the intended image. This random numbers can be generated with
the help of linear feedback shift registers. The seed value which Decryption is the process of decoding the encoded for encrypted
is set to the LFSR can be used as the key value for the encryption image to obtain the original input image which will in the form
process. This same key is used at the decryption stage but the of human readable or can be understood by machines. Decoding
random generated matrix will be different. After shuffling the process is normally done at the receiver end to make the data
row wise pixel values with the random numbers , we can obtain a readable to the intended receiver. Using the corresponding
row level encrypted image. That is almost 50 percent of the pixel decryption algorithm and decoding key we can decrypt the cipher
values of the original image got changed or encrypted. This can text back to the original format. The decryption process is not a
be verified by calculating the NPCR value of the encrypted and complex process, if we have the key for decoding it is very easy
the plain image. to decrypt the information. Here we need to perform two level of
decryption because at the encryption stage we perform a two
The second phase of encryption is the column level encryption. level encryption. So in order to achieve the original data it
We need to do the same steps as done in the row level requires two times decryption.
encryption, instead of row the process needs to be applied in
column wise. For column encryption again we need to generate a In the decryption stage , the reverse operation of the encryption
sequence of random numbers and these random numbers needs process is performed. In the encryption stage we follow the
to be converted into a matrix . This process is done to rearrange
processes in an order of row encryption, followed by column
or swap the pixel values of the image with the random matrix. encryption and finally performed an XOR operation. So in order
The column wise encryption is done on the row encrypted image. to decrypt these operations needs to be reversed. First we need to
After the pixel reordering we can obtain a column encrypted perform the XOR operation followed by column decryption and
image. To complete the encryption step , finally we apply the finally row decryption.
XOR operation to the encrypted image which results in a
complete encrypted image. The detailed representation of the
Therefore the first stage in the decryption process of the image
encryption process is shown in Fig.1 [1]. is to perform the XOR operation, in which the column and the
row pixel values of the image get XOR ed. The outputted image
after the XOR operation is subjected to column decryption. In the
column decryption step , it is necessary to generate the random IV. RESULT AND ANALYSIS
numbers for each column using the linear feedback shift register.
In the column decryption, we use the key seed value used in the
column encryption stage of the image. By combining the seed
value and the randomly generated matrix we can decode each
column of the encrypted image.
[5]. Vishal Kapur Surya Teja Paladi Navya Dubbakula , Two Level Image
Encryption using Pseudo Random Number Generators, International Journal of
Computer Applications (0975 8887) Volume 115 No. 12, April 2015
[6] Arihant Kr. Banthia Namita Tiwari , Image Encryption using Pseudo
Fig. 6 Decrypted Image Random Number Generators , International Journal of Computer Applications
(0975 8887) Volume 67 No.20, April 2013
Fig 6 shows the different levels of decryption in the encrypted
image. First step shows the image after XOR ing then it is [7]. Subhra Mazumdar , Tannishtha Som , Data Encryption with Linear
followed by the column and row wise decryption. Feedback Shift Register, International Journal of Scientific & Engineering
Research Volume 3, Issue 6, June-2012 .
The Number of Pixel Change Rate(NPCR) is also calculated for [8]. Yue Wu, Joseph P. Noonan, and Sos Agaian, NPCR and UACI randomness
this method. For the above test image the NPCR is calculated tests for image encryption, Cyber Journals: Multidisciplinary Journals in Science
using the formula [8] which is given as follows: and Technology, Journal of Selected Areas in Telecommunications, pp.31-38,
2011.
(,)
NPCR= , 100% [9].https://www.tutorialspoint.com/cryptography/modern_cryptography.htm
V. CONCLUSION
REFERENCES
[3]. C.K. Huang, C.W. Liao, S.L. Hsu, and Y.C. Jeng, Implementation of gray
image encryption with pixel shuffling and gray-level encryption by single chaotic
system, Telecommunication Systems, Vol. 52, pp563 571, 2013.
[4]. Bhaskar Mondal, Nishith Sinha and Tarni Mandal, A Secure Image
Encryption Algorithm Using LFSR and RC4 Key Stream Generator,