Confidential Image
Using Cryptograph
significant advancements in information
I) Abstract
With the advancement in technology, threats
have also increased. Data are available in
many form such as text, audio, image and
video. The best way to protect the data is
through encryption techniques. Encryption is
the traditional way of clearing data beyond
recognition. Most popular encryption
techniques such as AES, DES and RSA are
widely used in most of the applications. Over
the years, encryption has been widely used in
a variety of fields and domains, requiring
privacy and confidentiality. In this paper, we
propose a hybrid image encryption method.
The hybrid method includes encrypting the
image DNA (deoxyribonucleic acid), Chaotic
and Hash Function. The main advantage of
proposed method is highly efficient. The
proposed technique includes diffusion and
permutation at the DNA level. In the DNA
level permutation, a mapping function
depending on the chaotic maps is used to the
DNA image to dynamically rearrange the
locations of bit in the DNA picture. The
experimental findings and security evaluations
show that the proposed model not only has a
decent encryption effect and can withstand
known assaults, but it is also fast enough for
practical applications.
Keywords: Image, Encryption, secure, DNA,
Chaotic, hash
II) Introduction
Internet communication has become a vital
part of modern life as a result of
technology and the move from the
Desktop to the Internet Generation.
With the advancement in technology,
threats has also increased. Data are
available in many form such as text,
audio, image and video. Security
breach to and misuse of sensitive,
secret, and privileged data included in
images has become a severe concern.
So, the best way to solve the problem
to encrypt the data by the some new
technique. One of the most essential
approaches for ensuring protection
and maintaining the secrecy of image
data is image encryption. Various
image encryption algorithms have
been proposed, including those DNA
computing, cellular automata, logistic
chaotic systems, fractional transform,
and so on. In the DNA based image
encryption has some good
characteristics which attract
researcher to work under this
encryption method like huge storage,
massive parallelism and ultra-low
power consumption. When
implementing simply DNA-based
image encryption is insecure,
researchers are integrating DNA
computing with chaotic systems to
establish more efficient image
encryption solutions. In this
paper, we propose a new image
encryption method for this study that
is based on a hybrid algorithm of DNA
 computing, hash functions, possesses high anonymity, a wide key
and chaotic systems. The key space, and a more dynamic and
contribution of this paper were as unpredictable nonlinear.
follows:  The DNA level diffusion uses not only
various DNA operators, but also two
 Having started values and operational
classical algebra operators based on
parameters for chaotic systems are
DNA sequence, the DNA left and right-
formed to use a mixture of an
circular shift.
external key, MD5 and SHA-256 hash
algorithms, and plain picture data. As
a conclusion, the external private key
and the plain picture are very III) Literature Survey
vulnerable to the recommended
encryption process. A. An encryption based on DNA and AES
 Rather than binary coding, we used algorithm for hiding a compressed text in
quaternary coding in DNA encoding
coloured image.
and decoding, which is comparable in
data type to picture information. In this paper researcher used to encrypt
 The computational complexity of a 1D the message into 4 stages followed by the
chaos system is lower than the
DNA Algorithm.
computational complexity of a
multidimensional hyper chaos system. GZIP algorithm: In this stage message
To reduce encryption time, analyse were encrypted by compressed and
the 1D chaos system to measure the
reduced the size by 75%. GZIP algorithm is
combination of Huffman coding and LZ77
encoding, decoding rules for
algorithm.
encoding, decoding each pixel of a
simple image each clear picture pixel,
on the other hand, contains encoding
 AES Algorithm: After the message
encrypted, use the AES algorithm
and decoding rules that are
for increase the level of security.
determined by the clear image and
the outside private key. In summary,
the recommended encryption
techniques can withstand the current
potential threats. o This is an iterative algorithm, each
 To dynamically rearrange the iterative can called as round.
placement of bits in the DNA picture,
a mapping function relying just on o Round key is added in the first
chaotic sequence out from logistic round operation and cipher key is
map is used to a DNA image in the used to XOR the input plain text.
DNA level permutation.
 To decrease the execution time and o In each round there has 4 stages
enhance the security of the presented but the final round has only 3
encryption strategy, the key DNA stages.
image is formed directly from the
multiple hyper chaotic system, that
  LSB Steganography: LSB
steganography is for hiding the
encrypted message in a high
quality image.
o In this physical picture is converted
in to arrays called digital image,
and density of image pixel is
represented by the number.
 At the last stage, researcher used
DNA Algorithm to show that, it
make complex and difficult for the
hacker to find gap and hole
between transferring information.
 
 Researcher discuss the new field of
cryptography, called DNA
encryption.
o It is represented by the collection
of bases and formed as sequential
pattern in which there are four
bases adenine, Guanine, cytosine,
and thymine which is represented
by A, G, C, and T respectively.
o Message is Collection of letter and
It may be represented by the DNA
format (A,G, C, T).
Using both cryptography and
steganography the system will provide
security by combination of both DNA and
AES algorithm.
B. Protecting digital colour image
applying double phase encryption.
In this paper, Researcher talk about the
colour image for protecting from any third
party. He proposed the method of
cryptography for encrypting the digital
colour image.
Researcher discuss the method called
Wavelet packet tree(WPT) decomposition
and reconstruction to generate an
encrypted image, after that it will XOR the
image to obtain final encrypted image.
This method is based on the 2 phases to
generate encrypted image.
C. Color Image Encryption-Decryption
using RANDOM Noise and PMT.
In this paper author use RGB colour image
for encryption. This type of image is used
to contain confidential data.
Researcher discuss in paper about the
random noise and image rearrangement.
RGB image pixels values lies from 0 to 255
and they are integer value, so its very
difficult to add noise in it.
For adding noise, first need to convert
into YIQ format after that will able to add
or subtract random noise in image in it by
using different formula.
Researcher proposed method to encrypt
by using two private key which is hard to
break.
• First private key is special random
noise array with a very huge size
and it generated only once and
saved by both sender and receiver
and it contains value range from -1
to 1.
Second private key is the partition map
table (PMT) which is generated by sender
and sent to the receiver. The key store
information about the parts of image,
segment, location etc.
D. A Novel and Efficient Multiple RGB
Images Cipher Based on Chaotic System
and Circular Shift Operations.
This research talks about the multiple RGB
image rendering process. Multiple image
encryption schemes are required when
we want a real time bunch of Colour
Images. Cipher is one of the chaotic
system with shift operations and SHA-384
codes techniques. RBG numbers are
combined in rectangular fashion to get
hash codes. There are many operations
performed in order to get the right pixel,
diffusion with different components etc.
The performance also will be analysed and
carried out in effective, efficient, robust
and the real life adaptability of multiple
RGB image Cipher.
The present era of digital technologies,
the internet and the Internet of Things,
Big Data, etc. have revolutionized virtually
all the cultures of the nations. We
frequently save them and transmit them
through some public channel like the
internet. Traditionally, the objective of the
integrity of data has been realized by
encrypting it by classical ciphers like RSA,
DES, AES, etc. But unfortunately, these
ciphers cannot be used for images
encryption due to their different
characteristics like strong and bulky
volume, a connection between the
adjacent pixels, and repetitiveness. On the
other hand, chaotic maps/systems have
proved very excellent in generating
random data which was in turn used for
image encryption.
The reason for the breakage of these
ciphers was that no matter which image
was input, the same random data was
generated.
We see many methods involve encryption
of single images, but, only a few methods
involve the encryption of multiple images.
There are a few good features introduced
by MIE. This method of encryption and
decryption of multiple images is based on
simple circular row and column shifting.
The selection of rows and columns is
generated by two streams of chaotic
maps. The other one helps in deciding the
amount by which the selected column or
row has to be shifted. The diffusion effect
is added by the third stream from the
chaotic map. SHA-384 codes help to get
the sensitivity of the plain text. The 16
colors demonstrate the practical
usefulness of the framework and its
effectiveness. To handle the different sizes
of the images sic different ciphers are
used. This comprehensive security and in-
depth and analysis depict the efficiency
and effectiveness of this scheme.
E. A Common Method of Share
Authentication in Image Secret Sharing.
In this work, we have designed an ISS for a
(k, n)-threshold with a separate common
share authentication ability, which is
suitable for both dealer participatory and
dealer non-participatory authentication.
These ISS fuses the principle of polynomial
and VSS to achieve the additional features
of separate share authentication, no pixel
expansion, low encryption and decryption
(authentication) complexity, less
decryption and auxiliary encryption. The
experimental illustrations and theoretical
analysis have shown the effectiveness of
the designed scheme (ISS). We have
performed feature comparisons with the
related schemes to present the
advantages of this scheme. We chiefly
focus on following the works in future. We
will start with extending our scheme to
achieve tamper detection and location.
Then, we will apply some other typical ISS
principles to our scheme, such as the
Chinese remainder theorem-based ISS. At
last, we will study the tamper tolerant
ratio.
IV) Preliminaries
In this draft paper, Hybrid algorithm is
implemented to analyse the image encryption
time and security level. In this draft paper, we
implemented three algorithm DNA, Hash
Function and Chaotic System.
V) Chaotic systems
In probabilistic dynamical system, chaos is a
typical occurrence, showing unpredictable
behaviour and being highly sensitive to
starting states and features. Due to their
simplicity and low computational complexity,
single dimensional chaos systems are
frequently utilized in some picture encryption
schemes. The logistic map seems to be a
chaotic one-dimensional structure that works
like this:
The regression sequence is in 0 and 1 when a
belongs (3.89, 4]. The logistic map is an
excellent contender for selecting DNA
operations and DNA rules, as well as
completing the permutation operation in less
time. Hyper chaos is almost like a chaotic
system with two or more significant Lyapunov
exponents, as opposed to conventional
chaotic systems. In addition, the hyper chaotic
method has great secrecy, a vast key space,
and more complicated and unexpected
nonlinear behaviour, all of which help in the
formation of the key image.
VI) Deoxyribonucleic acid
sequence:
DNA Computing is a revolutionary method of
data security based on the biological DNA
structure. Data may be stored and sent via
DNA. A (Adenine), C (cytosine), G (guanine),
and T (thymine) are the four kinds of nucleic
acids that make up deoxyribonucleic acid
(DNA). The base-4 numeral system, often
known as quaternary, employs the numbers 0,
1, 2, and 3 to represent any real integer. The
DNA Bases nucleic acids A, C, G, and T have a
one-to-one connection with the quaternary
integers 0, 1, 2, and 3. Complementary digit
combinations 03 and 12 (binaries 00 11 and
01 10) match complementary DNA pairs CG
and AT according to Rule 1 and 4th order
coding in Table1.
As in proposed crypto algorithm, each pixel's
grey value is first marked as a four-digit
quaternary number, and then encoded into a
four-digit DNA sequence using one of Table
1's rules.
VII) Cryptography
operation using DNA
computing
The encryption operation turns plaintext to
cipher text, whereas the decryption function
reverses the process. We will explore certain
algebraic functions and biological DNA
sequences in view of the recent growth of
DNA computing. The first row of Fig-1 the
picture depicts the subtraction, multiplication,
addition, exclusive-nor and exclusive-or of
DNA operators. In computational
mathematics, a right circular shift seems to be
the function of restructuring the components
of a tuple to move the last entry with the first
place while moving all those other entries
towards the appropriate location.
Figure 2 (a) and (b) illustrate the results of the
DNA left-circular shift and DNA right-circular
shift operator operations determined using
Rule 1. The second row of Fig. 1 shows the
DNA left-circular shift and the DNA right-
circular shift.
VIII) The proposed
encryption/decryption
scheme:
Figure 3.1 illustrates the proposed image
encryption system's flowchart. The following
are the overall steps of the encryption
algorithm:
Steps1: Construct the value K-XOR and the
secret key K and the using the plain image's
MD5/SHA hash value and the external key K.
Steps2: Construct the quaternary image P2
from the plain image P1.
Steps3: To the DNA image P3, encode the
image P2.
Steps4: To obtain a sequenced DNA image P4,
apply a DNA-level sequence to the DNA image
P3.
Steps5: Algorithm 1 is used to compute the
key DNA image KDNA.
Steps6: Perform DNA level diffusion
between the randomly generated DNA
image P4 and the key DNA image KDNA to
obtain the diffused DNA picture P5.
Steps7: To have the cipher DNA picture P6,
decode the diffuse DNA picture P5.
Steps8: To have the cipher quaternary
image P7, decode the cipher DNA image
P6.
Steps9: Decoding the cipher quaternary
picture P7 to the integer range [0, 255]
cipher image P8.
IX) The Decryption Algorithm
The picture decryption algorithm is the
inverse of the secret key image encryption
method (the external key K and the hash
value H). The visual decryption algorithm's
workflow can be seen in Figure 5. The
decryption algorithm is divided into the
following steps:
Steps1: Using the external key K and the hash
value H, calculate the private key K and the
value K-XOR.
Steps2: Construct the quaternary picture P7
from the cipher image P8.
Steps3: To that same DNA image P6, encode
the quaternary picture P7.
Steps4: Algorithm 1 is used to calculate the
key DNA image KDNA.
Steps5: To have the non-diffused DNA picture
P5, do the inverse of DNA diffusion between
both the DNA picture P6 and the key DNA
picture KDNA.
Steps6: Erase the permutations effect by
applying the reverse of DNA permutation to
the non-diffused DNA picture P5, yielding the
non-permutated DNA picture P4.
Steps7: Decode the plain DNA picture P3 from
the non-permuted DNA picture P4.
Steps8: To have the plain quaternary picture
P2, decode the plain DNA picture P3.
Steps9: The plain quaternary picture P2 is
deciphered to the plain picture P1.
X) Experimental results:
A number of experiments analyses are carried
out in this part to assess the durability of the
proposed picture encryption technique. The
simple pictures are the grayscale photos
"Lena," "Baboon," "Peppers," and
"Cameraman" of size 512x512 from the CVG-
UGR image database. We compare the
proposed picture encryption system to many
alternative image encryption schemes in the
experiments. Each test was replicated ten
times to improve the accuracy of the data,
and the average results were published. The
test results of the proposed picture
encryption system are presented in Fig. 6
when the external
key="6b679b3c77826d30a79e612114a8c18df
984c176f4e529f684748ad052241b17". We
can determine that the cipher pictures are
comparable to the noise-like image, and that
they can provide no valuable information
about the plain image.
 XI) Conclusion:
This paper offers a new technique to picture
encryption depending on a hybrid version of
chaotic systems, DNA computing, and hash
functions. Use the hybrid MD5/SHA256 hash
function of the plain image and the secret key
to verify that changing one bit of the plain
picture or secret key changes the initial state
and control parameters of the chaos system.
Two novel algebraic operations DNA based
sequencing are the DNA right-circular shift
and DNA left-circular shift. The results of the
trials demonstrated that the suggested
picture encryption system not only
outperforms five prior common image
encryption techniques in terms of security,
but it is also fast enough for practical
applications.

XII) Reference: