Image encryption using secret variant session key

Hari Narayan Khan1, Ayan Chaudhuri2, Abhishek Das3*, Atal Chaudhuri4

1
Department of Computer Science and Engineering, Regent Education and Research Foundation, Kolkata, India
2
Department of Computer Science and Engineering, Techno India, Kolkata, India
3
Department of Computer Science and Engineering, Aliah University, Kolkata, India
4
Department of Computer Science and Engineering, Jadavpur University, Kolkata, India
*Email adas@aliah.ac.in

Abstract—Increased use of internet demands substantial protection for secret image file from any adversary, specifically during
transmission. In the field of cryptography there are two role models: cryptographer and crypt-analyst/attacker. The cryptographer
develops techniques to make certain safety and security for transmission while the crypt-analyst attempts to undo the former's work by
cracking that system. So, the basic goal of our scheme is to design an image encryption model which is more challenging to break by any
attack. In our paper, we have introduced key dependent image encryption technique where the session key is the function of original
secret key (known for a couple of sender and receiver one time forever at the beginning) and the present secret image to be broadcast.
Additionally the scheme does not require extracting and remembering of session key to construct next session key although the session
key changes in every transmission. Furthermore here double encryption technique has been proposed, which reveals that the technique
is more robust to resist any cyber attack than conventional image encryption techniques till date.

Keywords—Session key, Symmetric cryptography, Image encryption, Image histogram, Secure Hash Algorithm (SHA), Linear
Geometry, Shuffle Cipher.
I. INTRODUCTION
Nowadays, secret images are transferred over internet in
every political, medical, military, social and so many
important commercial purposes. So, the main goals for image
encryption are Data Confidentiality, Data Integrity,
Authentication, and Non-Repudiation. Each communicator
wants to ensure that only the real beneficiary must get the data,
instead of any eavesdropping third party at every time of
communication.
The existing cryptographic protocols can be broadly
classified into two categories: symmetric (or private) key
cryptography and asymmetric (or public) key cryptography
[1], [2], [3]. In symmetric key cryptography, same key is used
for encryption and decryption. That secret key is only known
to the sender and the receiver. In contrast, for an asymmetric
key cryptosystem, dissimilar keys are applied for encryption
and decryption. The encryption key is public while the
decryption key is private. This effectively means that anyone
can encrypt a message using the intended receiver’s public
key, but only the intended receiver can decrypt the message by
using his private key. The main idea behind such a system is
that although it is computationally easy for a person in the
cryptosystem to generate a pair of public and private key. It is
very challenging for an adversary to achieve an individual
private key by the help of the knowledge of their public key,
which is known as the discreet logarithmic problem. Hence,
unlike asymmetric key cryptosystem, a symmetric key
cryptosystem requires a secure exchange of secret key
primarily for a couple of dispatcher and receiver.
Here, we present a noble concept of an image-based
cryptography using time-variant symmetric key [4], [5], [6],
[7], [8]. In existing symmetric cryptosystems, if a hacker
hacks the key at any time of communication, the total images
are visible to him that is if hacker acquires the symmetric key,
he/she can be benefited from that key as long as it is not
altered. At our proposed scheme, the session key is the
function of original secret key, known for a couple of sender
and recipient one time forever at the beginning of the
broadcast. So, it is clear that the encryption key will modify in
every session of communication. Essentially some invariants
are derived from the secret image. The proposed crypto-
algorithm is based on mutually the invariants of the original
secret image and the secret key. We already derived the
invariant property for secret plain-text [9]. The algorithm is
such that, if one crypto-attack is occurred in a particular
session, but the third-party will get no instalment of his effort
in the next sessions. In this scheme, double encryption
technique is introduced. They are key based image encryption
technique [10], [11], [12], [13] and key based Shuffle
encryption technique [14]. In first phase image encryption uses
Session key1 based on secret key, one byte value extracted
from invariant property of secret image [15], [16] and size of
the secret image. After that, the key based Shuffle encryption
uses Session key2 formed by the invariants of the cipher
extracted from preceding Image encryption phase.
Accordingly there are some developments occurred which
confirm that the proposed scheme is more powerful against
crypto-analysis than any conventional image encryption
techniques. Apparently time complexity of the algorithm is to
some extent high because of double encryption although that
pay off is rather tolerable, allowing for the strength in the
direction of crypto assault, as the scheme is mainly based on
session key of two different levels.
At subsequent part, there is through description of the
encryption and decryption phase followed by security analysis
on the encryption technique along with the cryptographic
strength analysis against various cyber-attacks.
 II. THE ALGORITHM The key based shuffle encryption has been introduced using
Session key2 in second phase of encryption technique. The
A. Encryption Phase:
essential criterion of the scheme is the counts of different bytes
Encryption phase of the algorithm commences with a secret should be same before and after the encryption. So, shuffled
key (settled for a couple of dispatcher and recipient one time encryption is considered in the second phase of encryption to
forever at the beginning) and a secret image to be encrypted fulfil the condition.
for transmission. Next calculate a single byte value W, which After Shuffling we have applied the reversible algorithm
is basically bitwise XOR operation of all the bytes of secret which uses 64 bytes (512 bits) digest data of an original secret
image and extract four bytes size of the secret image from the key to push the W value (one byte) and the header of the
header of the image. Next 512 bits (64 bytes) hash function of original secret image (fifty four bytes for .bmp image) into the
the secret key is constructed using appropriate hash function shuffled cipher prior to transmit for the receiver.
generation algorithm like Whirlpool, SHA-512 etc.
Next generate 16 bytes (128 bits) session key (remind it as B. Encryption phase Flow Chart:
Session key1) as the function of W as well as size of the secret
image from 512 bits hash digest.
Now Session key1 is used for image encryption to encrypt the
secret image and the encrypted result is known as intermediate
cipher for the subsequent ciphering stage. The concept of
linear geometry is used for image encryption to get the
intermediate cipher. The basic idea of image encryption is
ciphering an image using block ciphering concept, where each
block size is 4 bytes. On the other hand generate a 4 cross 4
random matrix (M) by any random-matrix generation
algorithm from 16 bytes Session key1. Now each 4 byte secret
block of secret image (I) will be ciphered by matrix
multiplication technique with the random matrix (M) and take
mod 251 of each of the cipher data to produce final cipher data
(Cp) using equation no. 1.

  (1)
Cp[ i ]i =0 to 3 =
  M [ i , j ]I [ j ]  mod 251
 j =0 to 3 
Fig. 1. Encryption Phase Flow Chart
The largest prime number is 251 in 8 bit and for mode
operation any single byte secret data will be converted to one C. Decryption Phase:
byte ciphered data. So, size of the encrypted image will be
In decryption phase, recipient generates 512 bits (64 bytes)
equal to the size of the secret image and the Session key1 is the
hash function of the original secret key. Using the reversible
variant of the Secret image itself.
algorithm on the received cipher one can isolate the W value
Finally, 2nd level ciphering is introduced to develop a
(one byte) and the header of the original image. From the
scheme to transmit one byte W value and the four byte size of
header of the original image one can isolate the four byte
original image to the recipient with confidential way from
image size. When the receiver finds the W value and the size
every eavesdropping. Here hiding algorithm pursues to hide
of the secret image, it can easily reconstruct Session key1 from
the entire header of the image instead of the size for enhanced
64 bytes digest of the secret key.
attack complexity of the scheme as well as the retrieved secret
If Session key1 is successfully obtained, so it is possible to
conforms image format at the receiver end.
form the normalized vector (16 bytes) which is basically the
We designed Session key2 as follows by the variant of
invariant of intermediate cipher, from the received data. Next
intermediate cipher for second phase ciphering.
reconstruct Session key2 by using bitwise XOR operation of 16
Step1: Now session key1 is appeared as 16 bytes data.
bytes of Session key1 and 16 bytes normalized vector.
Calculate the occurrence of every byte of the Session key1
Subsequently Session key2 be applied on received data after
present in intermediate cipher. The no. of count for some bytes
removal of single byte XOR value and 54 bytes header to get
can be nil. So, the scheme demands a normalization to avoid
the intermediate cipher after reverse shuffling.
zero in the final result.
In the final decryption phase again generate a 4×4 random
Step2: Then collect 16 nonzero counts corresponding to 16
matrix (M) from 16 bytes Session key1. Then calculate inverse
bytes existing in Session key1 and form a vector of 16 bytes as
matrix M-1 of matrix (M). Now choose initially a 4 byte block
the variant of intermediate cipher which is called feature
from shuffled encrypted bytes. Then follow equation no. 1
vector.
(only M will be replaced by M-1) to reconstruct 4 bytes
Step3: Next generate Session key2 for the second phase
original secret. The process will be repeated up to the last byte
encryption by using bitwise XOR operation of 16 bytes of
of encrypted image to get the original image back.
Session key1 and 16 bytes feature vector achieved in step2.
D. Decryption phase Flow chart:
Fig. 2. Decryption Phase Flow Chart
1. Session key1 Generation Algorithm
the fifty five 8 bit binary numbers to obtain 55 decimal
numbers ranging from 0 to 99. They are denoted as h1, h2, h3,
... , h55 correspondingly.
Step 3: The shuffled cipher is chosen and place W value
after ‘h1’ byte from the beginning. Then go ‘h2’ bytes and put
the MSB of the header, after that leave ‘h3’ bytes and place
2nd MSB of the header and so on. (No collisions will occur
and no chance to exceed 256×256 = 65536 byte positions too.
One should consider some lower mod instead of mod 100 if
the image size is less.).
III. EXPERIMENT ON ENCRYPTION TECHNIQUE
A. Experimental result set1:
An 8 bit bmp image of size 90000 bytes is exhibited
in figure. 3.a representing the original secret image. Session
key1 and Session key2 are generated form secret image and
user key “result@test1” for both encryption and decryption
phase. 55 bytes of Header and W are hidden into final
encrypted image and sent the binary file. So, it is very
difficult to understand the original file extension which
provides additional protection to the cryptosystem.

Step 1: First generate 512 bits (64 bytes) digest of an

original secret key by SHA2 - 512 bits hash algorithm.
Step 2: W value of the secret image in one byte and size of
the same image in four bytes are determined and concatenates
these two informations to five bytes. Next generate 224 bits
data from those 5 bytes using SHA2 - 224 hash algorithm and
Figure. 3.a: SecretImg1.bmp Figure. 3.b: EncryptImg1.bmp
collect only first 96 bits from 224 bits digest data. (300 × 300) Size = 90000 Bytes
(300 × 300)Size = 90000 Bytes
Step 3: Divide 96 bits data achieved from earlier step 2 into
6 bit groups and obtain 16 numbers of 6 bits value ranging
from 0 to 63. From 64 bytes digest obtained in 1st step, select
that 16 bytes where each six bits value indicates 1 byte value
of 64 bytes digest data (consider the repetition of same byte).
Step 4: Finally save 16 bytes data obtained in Step 3 as
Session key1 and subsequently utilize it at image encryption
and generate intermediate cipher data.
2. 16 bytes feature vector generation Algorithm Figure . 3.c: EncryptImg2.bmp Figure. 3.d: FinalEncrypt.bmp
(300 × 300)Size = 90000 Bytes + Hidden 55 byte
Step 1: Consider individual count of every byte range from (300 × 300)+55 Size = 90055 Bytes
00H to FFH present in the intermediate cipher (forms a 256
bytes count vector) which is also known as histogram. Next
we find the smallest non-zero element in this 256 byte
histogram and replace all zero elements of the histogram by
that to get normalized histogram.
Step 2: Collect the 16 counts from normalized histogram
corresponding to 16 bytes of Session key1 and calculate mod
256 of all of the 16 counts in an attempt to obtain 16 bytes
long feature vector. Figure 3.e: DecryptImg1.bmp Figure 3.f: FinalDecrypt1.bmp
(300 × 300) Size = 90000 Bytes (300 × 300) Size = 90000 Bytes
3. 55 bytes hiding Algorithm
Fig. 3. 8-bit gray scale images of original secret, encrypted and decrypted
Step 1: Collect first 55 bytes of 64 bytes digest data
with same user key.
obtained from original secret key and consider as binary
number of 8 bit. B. Experimental result set2:
Step 2: Assume that the size of .bmp secret image is An 8 bit bmp image of size 118496 bytes is exhibited
256×256 bytes. Then take mod 100 of decimal equivalent of in figure.4.a representing the original secret image. Session
key1 and Session key2 are generated form secret image and A. Statistical analysis:
user key “result@test1” for two level encryptions. But in
It is very important to a cryptosystem. A perfect
decryption phase user key is “result@test2”.
crypto-system should be anti statistical attack. The robustness
of our scheme can be examined by performing some statistical
tests such as value of correlation coefficient analysis, the
histogram analysis, MSE and PSNR measurement.

1. The Histogram analysis:

Figure . 4.a: SecretImg2.bmp
(368 × 322)Size = 118496 Bytes
Figure 4.b: EncryptImg1.bmp
(368 × 322) Size = 118496 Bytes
This analysis illustrates the fashion of pixels
distribution of any image by plotting the no. of pixels at all
intensity levels. The histogram analysis of grey scale sample
image (SecretImg1.bmp) at different stages of encryption and
decryption are exposed in the figures bellow. The histogram of
encrypted and decrypted images moreover has uniform
distribution and there is noticeably different from the original
image in addition of no statistical similarity. This establishes
the strength of the scheme.

Figure . 4.c: EncryptImg2.bmp Figure. 4.d: FinalEncrypt.bmp

(368 × 322)Size = 118496 Bytes + Hidden 55 byte
(368 × 322) +55 Size = 118551 Bytes

Figure. 5.a: Histogram of Figure. 3.a Figure. 5.b: Histogram of Figure. 3.b

Figure . 4.e: DecryptImg2.bmp Figure. 4.f: FinalDecrypt2.bmp

(368 × 322)Size = 118496 Bytes (368 × 322)Size = 118496 Bytes

Figure. 5.c: Histogram of Figure. 3.c Figure. 5.d: Histogram of Figure. 3.d

Figure . 4.g: DecryptImg2.bmp Figure. 4.h: FinalDecrypt2.bmp

(368 × 322)Size = 118496 Bytes, (368 × 322)Size = 118496 Bytes,
Decrypt using “result@test1” Decrypt using “result@test1”

Fig. 4. 8-bit gray scale images of original secret, encrypted and decrypted Figure. 5.e: Histogram of Figure. 3.e Figure. 5.f: Histogram of Figure. 3.f
with different user key.
Fig. 5. Histogram of original, encrypted and decrypted images of Figure. 3.

IV. SECURITY ANALYSIS ON ENCRYPTION TECHNIQUE 2. Value of Correlation:

Cryptographic system must be robust against Different
cryptographic and statistical attacks. The security analysis of
the proposed algorithm is performed by applying key
sensitivity analysis and statistical analysis. The performance of
a cryptosystem for resistance against various cyber-attacks can
be evaluated by the following means.
An image encryption algorithm must generate
encrypted image having no similarity with the secret image.
Thus, the value of correlation coefficient must be low. Here,
the correlation values between original and encrypted as well
as decrypted image are calculated. The correlation values are
generated using equation no. 2 and shown in Table 1.
  ( X − X )(Y − Y ) ab ab
(2)
4 Figure.3.a & Figure.3.e : 233.5269 24.4474
Infinity
r= a b 5 Figure.3.a & Figure.3.f : 0
(  ( X − X ) )( (Y − Y )
ab
2
ab
2
) 6 Figure.4.a & Figure.4.b : 233.8343 24.4417
a b a b 7 Figure.4.b & Figure.4.c : 233.7331 24.4436
Where X and Y are mean of X and Y respectively. There is 8 Figure.4.a & Figure.4.f : 233.7484 24.4433
no such straight relationship between the original and the 9 Figure.4.a & Figure.4.h 0 Infinity
encrypted images if the value of correlation coefficient is low.
Table 2: MSE & PSNR Value

IMAGES
1 Figure.3.a & Figure.3.b
2 Figure.3.a & Figure.3.c
3 Figure.3.a & Figure.3.d
4 Figure.3.a & Figure.3.e
5 Figure.3.a & Figure.3.f
6 Figure.4.a & Figure.4.b
7 Figure.4.b & Figure.4.c
8 Figure.4.a & Figure.4.f
9 Figure.4.a & Figure.4.h
TABLE 1: CORRELATION VALUES FOR DIFFERENT KEYS
In the above table the 5th and 9th entry show the
value of correlation coefficient one among secret image and
reconstructed image which confirms the lossless decryption.
The 8th entry shows a value closer to zero because image is
decrypted unsuccessfully due to wrong key.
3. The value of MSE & PSNR:
The Mean Square Error (MSE) and Peak Signal to
Noise Ratio (PSNR) have been computed considering different
images in our scheme. It is obvious that the high MSE value
and the low PSNR value can be achieved if and only if the
encrypted image is more randomly generated. The MSE value
is calculated using equation no. 3.
  P(i, j ) − P' (i, j )
1 Y X 2
MSE = i =1 j =1
XY
CORRELATION
COEFFICIENT
: -0.00082
: -0.00204
: -0.00204
: -0.00082
: 1
: 0.00684
: 0.00138
: 0.00204
: 1
(3)
High MSE value and low PSNR value indicate that
two images are totally dissimilar. Moreover, high PSNR value
signifies the high quality image.
B. Session Key sensitivity analysis:
Any key based cryptosystem must be highly key
sensitive. Changing of one bit/byte in the key, the retrieved
secret does not reveal any similarity or information about the
original secret. This property for the proposed scheme is
proved in experimental result set 2.
Moreover if the final ciphered image be tampered by
any adversary, the proper session key cannot be formed, even
from the correct secret key. Thus tampering will be detected at
the receiver end, which provides additional protection about
integrity of the secret image.
V. STRENGTH ANALYSIS OF THE ALGORITHM
In the proposed algorithm Session key1 and Session key2 are
used for two phase of encryption. The Session key1 is applied
in the first phase image encryption based on linear geometry.
Then Session key2 is introduced in shuffle encryption. There is
no doubt at former discussion that the two session keys are
basically the variant of secret image. Here one secret key is
used initially but the session keys used for a particular session
is the function of the secret key and the original secret image
itself. Subsequently the analysis of scheme strength over brute
force attack by a rival is as follows.
Initially, it is required to find out 55 bytes data i.e. W value
and header, from the final cipher by an adversary. So, it
requires

Where, p(i, j) is the pixel value of ith row and jth column of , where n is size of the
the image P and p’(i, j) be that of image P’. Here X represents final cipher image.
the no. of rows and Y represents the no. columns of the For n=256×256 bytes the no. of trails would be close to 2880.
original images. The values of PSNR are generated using Obviously, if the size of the image is increased the no. of trials
equation no. 4. must be better.
The no. of trials required for re-shuffling of the cipher data
 G2  is 16! i.e. 244, for each trial of 55 bytes removal as the size of
PSNR = 10  log10  
(4)
 MSE  Session key2 is 16 bytes, in an attempt to get the possible
cipher data.
Where 255 is the value of G for any grey scale image used in At last, 2128 trials are required if the adversary wants to
our calculation. The following Table-2 contains MSE and crack the 128 bit Session key1.
PSNR values. So, the total trials required for brute force attack to a cipher-
image are:
IMAGES
MSE PSNR 2880 244 2128 = 21052 for 256×256 bytes image.
VALUE VALUE Now assume that the key size is k bits and the image size is
1 Figure.3.a & Figure.3.b : 233.5269 24.4474
2L bytes. So, Strength for hiding 55 bytes is as fallows.
2 Figure.3.a & Figure.3.c : 233.4064 24.4496
2L × (2L-1) × (2 L-2) × (2 L-3) × … × (2L-54) = 255L
3 Figure.3.a & Figure.3.d : 233.4064 24.4496
Where, 2L>>54, i.e, L>>5.
Moreover, it is clear that the re-shuffle needed = (k/8)! will be broken after all these years. So, again it is ineffective to
The first phase encryption strength = 2k all successive transmissions using the proposed algorithm.
Therefore total strength will be (k/8)! multiply with 2(k +55L) The time required to break one single cipher will be:
Accordingly the strength differs on the image size. If the
size of the image increases the no of trials also be high, thus Years. (5)
more cryptic.
Now we have considered that an attacker successfully Where, Key is k bit and the size of the cipher is 2L byte.
cracks a key from a particular cipher by the brute force attack.
So the 128 bit Session key1 is known to the attacker for a pair Using equation no. 5, Table 3 and fig.6. are derived to show
of sender and receiver. Finally the original secret key remains the resistance of the proposed algorithm against possible
unknown because the session key is used for any particular 1 attack to break the secret key.
byte W value and 4 bytes length of the secret image. Table 3 and corresponding graph in fig.6. clearly indicate
So, we consider that the attacker is successful to recognize that requirement of time to crack single cipher data raises
the W value and the secret image size. But, remember that the exponentially with secret image size (L) and size of secret key
key is only valuable for the exacting sender and receiver pair (K). The strength of the proposed scheme amplifies
to any upcoming secret image where W value and size both exponentially with image size. It is most significance when the
are matched. In that case probability will be further development of supercomputers, the strength of our
scheme is definitely increases randomly and exponentially
considering secret image size 256×256.
with the increase of the size of secret image. More over our
Basically no cryptographic system pretends which is crypto-system will be the robust crypto-system in the near
theoretically eternal against the brute-force attack in prospect.
cryptography. Therefore concentrate on the calculation of the
time taken to break any cipher by the fastest supercomputers.
Remind it, the no of trials = 21052 = 4.825 × 10316 to break one
cipher data.
As of August 2016, the fastest supercomputer is Sunway
TaihuLight reaching 93.015 petaFLOPS on LINPACK
benchmark, located at National Supercomputing Center in
Wuxi, china with Linux operating system as Kernel. 93.015
petaFLOPS means 93.015 × 1015 floating point operation per
second. Positively, we can say that to check a single trial
requires 1000 FLOPS. Thus, the number of trials finished per
second is 93.015 × 1012 and the number of seconds in a year =
60 × 60 × 24 × 365 = 3153600.
Fig. 6. Attack Complexity Graph
So, the time required to crack one single cipher is:
4.825  10316
= 1.64  10 296 Years
93.015  1012  3153600

As a result, only a single pair of secret image and cipher image

TABLE 3: ATTACK COMPLEXITY ANALYSIS

SECRET ATTACK THE ATTACK THE TOTAL ATTACK TIME NEEDED TO

KEY IMAGE SIZE COMPLEXITY COMPLEXITY COMPLEXITY FOR CRACK SINGLE
SIZE (bytes) TO DECRY TO CRACK PROPOSED ALGORITHM CIPHER IMAGE (IN
(bits) PT IMAGE ENCRYPTION SHUFFLE CIPHER YEARS)

128 256×256 2128 16! 244 21052 1.6*10296

128 512×512 2128 16! 244 21162 2.1*10329
128 1024×1024 2128 16! 244 21272 2.8*10362
136 256×256 2136 17! 248 21064 6.7*10299
136 512×512 2136 17! 248 21174 8.8*10332
136 1024×1024 2136 17! 248 21284 1.1*10366
192 256×256 2192 24! 278 21150 5.2*10325
192 512×512 2192 24! 278 21260 6.8*10358
192 1024×1024 2192 24! 278 21370 8.8*10391
256 256×256 2256 32! 2116 21252 2.6*10356
256 512×512 2256 32! 2116 21362 3.4*10389
256 1024×1024 2256 32! 2116 21472 4.5*10422
 VI. CONCLUSION
Cryptographer always searches for the scheme to build up
security and safety for each communication where session key
implementation is healthy established idea. The conventional
session based cryptography requires secret key exchange
earlier to each transmission. Here credit goes to the protected
key exchange method. Another technique is the current key is
the function of earlier decrypted image as well as the secret
key. So, additionally the scheme requires extracting and
remembering of session key to construct next session key. In
the proposed algorithm Session key1 and Session key2 are used
for two phase of encryption where two keys change in every
transmission but extracting as well as remembering of session
key is unessential to construct next session key. In this paper it
is clear that the strength of the scheme is enhanced against any
cyber attack than conventional image encryption techniques
for a particular key size.
Text Encryption Using Matrices, International Journal of Application or
Innovation in Engineering & Management, Volume 2, Issue 3, March 2013,
pp. 265-268.
[13] Mohammed Abu Taha, Mousa Farajallah, Radwan Tahboub 2011. A
Practical One Way Hash Algorithm based on Matrix Multiplication,
International Journal of Computer Applications, Volume 23– No.2, June 2011,
pp. 34-38.
[14] Naskar, P. K., Chaudhuri, A., Chaudhuri, A. (2014) ‘A Secure
Symmetric Image Encryption Based on Linear Geometry’, IEEE Conference,
Applications and Innovations in Mobile Computing(AIMoC), 2014, pp. 67-74.
[15] Nawal El-Fishawy and Osama M. Abu Zaid 2007. Quality of Encryption
Measurement of Bitmap Images with RC6, MRC6, and Rijndael Block Cipher
Algorithms, International Journal of Network Security, Vol.5, No.3, PP.241–
251, Nov. 2007.
[16] D. C. Mishra and R. K. Sharma 2013. Grayscale-image encryption using
Random Hill Cipher over SLn(F) associated with Discrete Wavelet
Transformation, Applications and Applied Mathematics, Vol. 8, Issue 2
(December 2013), pp. 777 – 791.

References
[1] PC Kocher, “Timing Attacks on Implementations of Diffie-Hellman,
RSA, DSS, and Other Systems", in Advances in Cryptology Crypto 96,
Springer LNCS v 1109 pp 104-113.
[2] C. E. Shannon “Communication Theory of Secrecy Systems”
Communication Theory of Secrecy Systems, Bell Systems Technical Journal,
Vol.28, pp.656-715, 1948.
[3] Avi Kak, Lecture Notes on “Computer and Network Security” in Lecture
15: Hashing for Message Authentication, April 25, 2012.
[4] E Biham, A Shamir, “Differential Fault Analysis of Secret Key
Cryptosystems", in Advances in Cryptology --Crypto 97, Springer LNCS v
1294 pp 513-525.
[5] Elaine Barker and Allen Roginsky, “Transitions: Recommendation for
Transitioning the Use of Cryptographic Algorithms and Key Lengths”, in
NIST Special Publication 800-131A, January 2011.
[6] L.R. Knudsen, "A key-schedule weakness in SAFER-K64," Advances in
Cryptology, Proceedings Crypto'95, LNCS 963, D. Coppersmith, Ed.,
Springer-Verlag, 1995, pp. 274-286.
[7] P. Chakrabarti, B. Bhuyan, A. Chowdhuri and C. T. Bhunia, "A novel
approach towards realizing optimum data transfer and automatic variable key
(AVK)," International Journal of Computer Science and Network Security,
vol. 8,no. 5,May2008.
[8] Rajat Subhra Goswami, Swarnendu Kumar Chakraborty, Abhinandan
Bhunia, C. T. Bhunia, "New approach towards generation of Automatic
Variable Key to achieve Perfect Security", 10th International Conference on
Internet Technology, Next Generation, ITNG, 2013, 14th – 17th April' 2013,
IEEE computer Society, CPS, pp:489-491.
[9] Khan, H.N., Chaudhuri, A., Kar, S., Roy, P. and Chaudhuri, A. (2015)
‘Robust symmetric cryptography using plain-text variant session key’, Int. J.
Electronic Security and Digital Forensics, Vol. 7, No. 1, pp.30–40.
[10] Bibhudendra Acharya, Girija Sankar Rath, Sarat Kumar Patra, Saro
Kumar Panigrahy. 2007. Novel Methods of Generating Self-Invertible Matrix
for Hill Cipher Algorithm, International Journal of Security, Vol 1, Issue1,
2007, pp. 14-21.
[11] Bibhudendra Acharya, Saroj Kumar Panigrahy, Sarat Kumar Patra,
Ganapati Panda 2010. Image Encryption Using Advanced Hill Cipher
Algorithm, ACEEE International Journal on Signal and Image Processing, Vol
1, No. 1, Jan 2010, pp. 37-41.
[12] M. Yamuna, S. Ravi Rohith, Pramodh Mazumdar, Avani Gupta 2013.