Wireless Pers Commun

DOI 10.1007/s11277-016-3313-x

An Improved Level of Security for DNA Steganography

Using Hyperelliptic Curve Cryptography

P. Vijayakumar1 V. Vijayalakshmi1 G. Zayaraz2

 Springer Science+Business Media New York 2016

Abstract Steganography is the art of science of hiding information which is more useful in
many social networks, digital media, and printing material. Many hiding algorithms are used
to flourish the security level of the recent wireless multimedia system to protect the data from
an attacker. This paper describes about existing steganographic based hiding methods using
LSB techniques, RSA algorithm, DNA cryptography and DNA steganography, which is used
to prevent copying, forgery and unauthorized access of videos, audios and images. Existing
hiding methods had demerit of increased key size, computational cost, speed and size of the
input. Thus the DNA steganography based Hyperelliptic Curve Cryptography (HECC) is
proposed which provides a higher level of security to image file and also assure the digital
media security. The proposed HECC based DNA steganography is compared with traditional
cryptographic techniques results in 30 and 42 % increased processing time for encryption
process and decryption process respectively. Finally, the proposed scheme is compared with
other traditional steganographic technique in terms of Mean Square Error, Peak Signal to
Noise Ratio (PSNR), embedding capacity. From the simulation results, it is inferred that, the
proposed steganographic method has, the less embedding capacity, high MSR and PSNR
value compared with other steganographic methods.

Keywords Steganography  Hyperelliptic Curve Cryptography  Elliptic Curve

Cryptography  Wireless multimedia system  Communication complexity  Computational
complexity  Deoxyribo Nucleic Acid

& P. Vijayakumar
Vijayrgcet@gmail.com
V. Vijayalakshmi
vvijizai@pec.edu
G. Zayaraz
gzayaraz@pec.edu
1
Department of ECE, Pondicherry Engineering College, Pondicherry, India
2
Department of CSE, Pondicherry Engineering College, Pondicherry, India

123
 P. Vijayakumar et al.

1 Introduction

In 1983, Cryptographer Gustavus Simmons published the first digital steganographic

method who formulated the problem of steganographic communication with illustrated
examples. The general model of steganography is defined for arbitrary communication
channels where the cover media such as image, video or audio files are used to embed the
secret message. Selection of cover media has to satisfy the following condition: Cover
image must be larger than secret message, indeterminacy and transmitting data that con-
tains indeterminacy must be plausible. The combination of embedding and extraction
function for a particular type of the cover image is called steganographic system. The
security of a steganographic system is defined by its strength to conquer the detection. The
effort to detect the presence of steganography is called steganalysis. In order to protect the
data from unauthorized access, the above mentioned steganography is used. For example,
information security has become one of the important prime concerns in the scenario of
secure data communication. The unauthorized access to transmitted data is one of the
major threats faced by wireless system. Cryptology is also another traditional technique
that hides the message by encoding it. Nevertheless, the demand is such that, the data being
transmitted should not only encode, but the very existence of knowledge of data trans-
mission should be concealed. Steganography is thus a technique where the data are not
only encoded, but hidden within a carrier. This therefore provides a two-level security. The
recent flourishing of multimedia systems has increased the need for protection of digital
media. Various methods and algorithms were adopted to prevent copying, forgery and
unauthorized access to videos, audio and images. However, the existing algorithms like
RSA, DES and Triple DES shared the common demerit of increased key size, computa-
tional cost, speed and size of the input [15]. These algorithms are improved by employing
DNA computing technique with cryptography and steganography techniques to provide a
higher level of security. The DNA computing techniques enables the system to handle
large number of users due to its huge storage capacity of DNA molecules. The list of DNA
molecules used for mapping the plaintext are Adenine, Guanine, Cytosine and Thyamine.
These DNA molecules enable the user to provide a higher level of security with less
computational complexity [6] [7]. Thus the proposed concept of an image encryption using
DNA computing based steganography using Hyperelliptic Curve Cryptography (HECC) is
a highly secured and efficient method of assuring digital media security. Many researchers
put their effort to develop the algorithm for encapsulate the image into the series of DNA
strands.
This manuscript is organized as follows. This section gives an introduction about
steganography, cryptography and DNA computing technique. Section 2 describes about a
detailed literature survey on existing DNA computing based scheme. Section 3 deals with
existing hiding techniques using steganography and DNA cryptography method. Section 6
shows the algorithm for proposed DNA computing based HECC cryptographic scheme.
Section 7 affords with the simulation results. The last section concludes this paper.

2 Related Works

Tawalbeh, L proved that Elliptic Curve Cryptography based encryption algorithm meet the
multimedia encryption requirement and does not affect the compression efficiency.
Selective encryption is performed on the transform coefficient and perceptual encryption is

123
An Improved Level of Security for DNA Steganography Using

applied based on selective bit plane encryption. With the help of these two algorithms, he
improves the encryption efficiency, compression efficiency, code compliance and security
level [8]. But these algorithms require more computational time to obtain the improved
results. In order to overcome the above limitation, Hyperelliptic Curve Cryptography based
encryption algorithm is recommended, due to its short operand size compared with other
public key schemes [9]. These cryptographic techniques are combined with DNA com-
puting techniques, to improve the information storage capacity and security level. Gehani
[10] presented a procedure for DNA based one time pad encryption schemes, which enable
the user to store more information in a small amount of DNA. He also presented a novel
use of chip-based DNA micro-array technology for 2D data input and output to improve
the security level with less computational complexity. Beck described a method to insert
information into a DNA sequence for the purpose of data storage, watermarking, or
communication of secret messages known as DNA cryptography [11]. Here, information
are expressed as series of Adenine (A),Cytosine (C), Thyamine (T) and Guanine (G) in-
stead of zeros and ones. Guozhen et al. [12]. also summarized the progress of DNA
cryptographic research and introduced the biological background of DNA Cryptography.
He discussed about recent trends of DNA cryptography and compares the status, security,
application fields of DNA cryptographic techniques with other traditional cryptographic
techniques such as quantum cryptography etc.
With the increase in expertise level of the attackers in wireless system, a need for
securing large volumes of data is the need of the hour. DNA steganography is an inno-
vative and creative approach which has the combination of DNA computing technique and
steganography. Chakraborty et al. [13] presented a lossless image steganography approach
to hide a secret image in the cover image. DNA sequencing, Sudoku solution matrix and (t,
n) threshold sharing systems are used to accomplish the approach to represent the secret
image, cover image respectively. Camouflaging process is used to embed the secret image
into cover image and stego image is obtained. Balado [14] proposed a DNA based data
embedding technique using substitution mutation modelled. Kimura model from molecular
evolution studies are used to improve the capacity of DNA data. These substitution
techniques are vulnerable to many attacks due to its weakness of security. Das focused on
the concept of using single stranded DNA as primary cover and analyzed the security
loopholes of traditional algorithms against visual and statistical attacks. The simulated
results proved that the Dual cover steganography provides better security than existing
algorithm [15].

3 Existing Data Hiding Techniques

Many hiding algorithms are developed to improve the level of security for wireless mul-
timedia system. These algorithms were used to hide a data in an image, image within an
image, data in a video and these algorithms were famous because of their security features
and feasibility. Steganography is basically the technique of covered writing. Its origin can
be traced back to cryptographic technique. Both are same in the context of application, but
differ in the methodology. In cryptography, the data is hidden by encrypting it, whereas in
steganography the existence of information is hidden. Steganography can be performed
using various methods. One of the popular methods employed was LSB (Least Significant
Bit) method. In this LSB technique, each LSB pixel of the cover image is replaced with the
bits of secret message such that the difference is not noticed by the human eye and the

123
 P. Vijayakumar et al.

visual perception image is not altered by the hiding of the data. The major limitations of
the LSB steganographic method are vulnerable to various attacks because detection of data
is much easier and message integrity can be easily destroyed by the attacker [16].
Image steganography is another technique in which an image is embedded into another
image. A cover image is taken such that it has same pixel size as that of the secret image.
The cover image selected for this should have a larger capacity than the embedded image.
The LSB pixel values of cover image are replaced by the MSB value of secret. The major
drawback of this technique is that the carrier image undergoes changes which can grab the
attention of a hacker or an eavesdropper. Cryptography is a very old method of retaining
the secrecy of the message. This converts the data to some other form before transmission
and the message is retrieved at the receiving side by doing the reverse process. In DNA
cryptography, a DNA sequence is used to encrypt the message. Here the plain text is
converted to DNA nucleotide triplet using generalized characters to the nucleotide triplet
conversion table as shown in Table 1. This is again converted to binary number using
nucleotide to binary conversion table. This is then transmitted and the reverse operation is
performed at the receiver side [17].

Table 1 Characters to nucleo-

DNA nucleotide Alphabets Numbers DNA nucleotide
tide triplet conversion
triplets triplets

AAA A 0 CAC
AAT B 1 TAC
ATT C 2 AGC
ATG D 3 CTT
ACT E 4 CGG
AGT F 5 GAC
GCT G 6 GAT
GGA H 7 TTA
ACG I 8 ATG
GAT J 9 TTA
GGC K
ACC L
AGA M
GGT N
GTA O
CTT P
AGT Q
GTG R
GCG S
GAG T
CCC U
AGG V
GGG W
GGT X
TCG Y
TTT Z

123
An Improved Level of Security for DNA Steganography Using

4 Proposed DNA Steganography Technique for Increased Level

of Security

Image hiding algorithm aims to hide a secret image in a larger carrier such that it does not
discern the presence of the hidden image. It employs the advantage of both DNA cryp-
tography and Steganography. It attempts to hide an image in another image by converting
it into DNA sequence using the nucleotide to binary conversion table. A cover image or a
container is selected which has the same pixel size as that of the image to be embedded.
The embedding process involves three steps as shown in Fig. 1. First, the pixel values of
both the cover and secret message are converted to their respective DNA triplet value using
characters to the DNA triplet conversion Table 1. Secondly, the triplet values are con-
verted to binary values using DNA triplet to the binary value conversion Table 2.
In the third and final stage, the two binary valued matrices corresponding to cover and
secret messages are XOR with each other. On the receiver side, the extraction process is
employed has three stages, and performs the reverse operation of the embedding process.
This regains the original secret image from the stego image. The 3 9 3 pixel size of an
image matrix is considered to explain the transmission and reception procedure.
Sender Side In the sender side, the cover image is used as a carrier to hide the secret
message image as shown in Fig. 2.
Step 1 The 3 9 3 pixel matrix of the cover image is taken
Step 2 The 3 9 3 pixel matrix is converted to DNA nucleotide triplet using character to
the nucleotide conversion table

Cover Image

Secret Image Embedding Process Stego Image

DNA Steganographic Key

Secret Image Extracting Process

Cover Image

Fig. 1 Block diagram of image hiding technique

123
 P. Vijayakumar et al.

Table 2 Nucleotide to binary

Nucleotide Binary equivalent
conversion
A 00
C 01
G 10
T 11

Fig. 2 DNA steganographysender side

Step 3 The DNA nucleotide triplet corresponding to each image pixel value is mapped to
binary digits using nucleotide to binary conversion table. The step 13 is repeated
for secret image
Step 4 XOR operation is performed between the compressed binary form of the cover
image and the secret image. The resultant image is called stego image. This is
then transmitted.

Receiver Side On the receiver side, the stego image and cover image are XORed to
recover the secret message image as shown in Fig. 3.
Step 1 The stego image is received
Step 2 The compressed binary form of the cover image and stego image are XORed. The
resultant is the binary form of the secret image
Step 3 The binary to the nucleotide conversion table is used to convert the binary form
to DNA triplet form
Step 4 The DNA nucleotide triplet is converted to a decimal pixel value using character
to the nucleotide conversion table. The actual message image is retrieved after
Step 4 using the proposed algorithm.

123
An Improved Level of Security for DNA Steganography Using

Fig. 3 DNA steganographyreceiver side

4.1 Proposed DNA Computing Based Steganography Using Hyperelliptic

Curve Cryptography

The proposed algorithm describes a highly secured steganography technique using DNA
sequence combined with Hyperelliptic Curve Cryptography. It implements the advantage
of both DNA computing technique and Hyperelliptic Curve Cryptography to provide a
greater level of security. The first level of security is given by encrypting the original data
using HECC encryption algorithm. The ciphertext is hidden and the resultant image, is
known as stego image as shown in Fig. 4. Second level of security of data is provided by
employing DNA mapping, nucleotide conversion and XOR operation using stego and the
cover image.

Plaintext HECC Embedded

into an Image Stego Image
Encryption

Secret Key
Secret Image to be
communicated

Fig. 4 Hiding plaintext into secret image

123
 P. Vijayakumar et al.

Sender Side The mapping of pixel values of cover and secret image with DNA
nucleotide, conversion of DNA nucleotide into numbers, numbers into binary digits and
encryption of image file using HECC is demonstrated in the block diagram in Fig. 5. The
following steps are followed to obtain the ciphertext points:
Step 1 Get an image file of known size
Step 2 Convert the pixel values into DNA nucleotide using Table 1
Step 3 Convert the DNA nucleotide into binary digits as shown in Table 2
Step 4 Binary digits of stego and cover image subject to XOR operation
Step 5 Convert XOR values into a decimal value
Step 6 Convert the decimal numbers into HEC points using Koblitz method
Step 7 These points are encrypted using HECC encryption algorithm and obtain the
ciphertext points.

Receiver Side The decryption of ciphertext points, conversion of points into decimal,
decimal into binary digit, XOR operation, mapping of binary digit with DNA nucleotide,
mapping of nucleotide with plaintext is demonstrated in the Fig. 6. The following steps are
followed to obtain the plaintext points.
Step 1 Decrypt the ciphertext points using HECC

Cover Image Stego Image

Pixel values
mapped with Pixel values
DNA Nucleotide mapped with
DNA Nucleotide

DNA
Nucleotides DNA
mapped with Nucleotides
Binary Digits mapped with
Binary Digits

Ex-OR operation

Binary Digits
converted into points HECC Ciphertext
using Koblitz method Encryption points

Secret Key

Fig. 5 DNA steganography with HECCsender side

123
An Improved Level of Security for DNA Steganography Using

Step 2 Convert the points on the Hyperelliptic curve into a decimal value
Step 3 Convert the decimal number into binary digits
Step 4 Compute the XOR operation using binary values of stego and cover image
Step 5 Convert resultant binary number into DNA nucleotide using Table 2
Step 6 Map these DNA nucleotides into alphabets using Table 1
Step 7 Recover the original plaintext.

5 Results and Discussions

The existing and proposed hiding techniques were simulated and tabulated as shown
below.

5.1 LSB Steganographic Technique

Cover image is the carrier into which the secret message is embedded. The stego image is
the cover image with a secret message embedded within it by LSB technique. The message
used for hiding is Hi Welcome you All and the cover image used for hiding the data is
shown in Fig. 7. The resultant stego image is shown in Fig. 8.

Ciphertext HECC
Plaintext points
points Decryption

Cover Image Points converted into Decimal

Public Key Values using Koblitz method

DNA Nucleotides mapped with Binary Digits Decimal values converted into Binary Digits

Ex-OR operation

Binary Digits mapped with DNA Nucleotides

DNA Nucleotide mapped with Pixel values Stego Image

Fig. 6 DNA steganography with HECCreceiver side

123
 P. Vijayakumar et al.

Fig. 7 Cover imageLSB

technique

Fig. 8 Stego imageLSB

technique

5.2 Hiding an Image Within Another Image

MATLAB is used for simulation of embedding an image within an image. A cover image
is the container into which the secret image is embedded. The stego image is the cover
image with embedded secret message inside it. The cover image with pixel size 284 9 177
is read at the input as shown in Fig. 10. The secret image used has a pixel size of
284 9 177 as shown in Fig. 9. The cover image is chosen so as to match this pixel size.
The secret image is converted into four bit image which is suitable for hiding as shown in
Fig. 11. The stego image obtained as the result of the simulation is shown in Fig. 12.

5.3 DNA Computing Based Steganography using Hyperelliptic Curve

Cryptography

The cover and secret image, taken for DNA mapping is shown in the Fig. 13 and Fig. 14
respectively. DNA mapped images are shown in Fig. 15 for cover image and Fig. 16 for

123
An Improved Level of Security for DNA Steganography Using

Fig. 9 Secret imagehiding an

image within another image

Fig. 10 Cover imagehiding

an image within another image

Fig. 11 Four bit image to hide

123
 P. Vijayakumar et al.

Fig. 12 Stego imagehiding an

image within another image

Fig. 13 Cover imageDNA

based steganography

secret image. These images are converted into binary image for the XOR operation to hide
an image within another image as shown in Figs. 17 and 18. The XORed image is shown in
Fig. 19. The XORed image is encrypted with the HECC encryption algorithm and resultant
encrypted image is shown in Fig. 20. The reverse process is carried out to recover the
original image from the XORed image as shown in Fig. 21.

5.4 Embedding Capacity

Table 3 shows the comparison of embedding capacity for different size of images such as
N = 256, 512, 1024 and 2048 for different Hiding Techniques. Embedding capacity is the
size of the secret data that can be embedded into a cover image without weakening the

123
An Improved Level of Security for DNA Steganography Using

Fig. 14 Secret imageDNA

based steganography

Fig. 15 DNA mappedcover

image

integrity of the cover image represented by bits per pixel (bpp). It depends upon the
characteristics of the cover image and the embedding algorithm used for steganography.
From the simulation result as shown in Fig. 22, it is inferred that embedding capacity of
LSB technique is very less compared with the proposed DNA computing based
steganography using HECC. However, the embedding capacity varies with respect to
characteristics of the cover image.

5.5 Mean Square Error (MSE)

Mean Square Error is defined as the square of the error between cover image and stego-
image. The distortion in the image can be measured using MSE and is calculated using
Eq. (1)

123
 P. Vijayakumar et al.

Fig. 16 DNA mappingsecret

image

Fig. 17 Binary value

mappingcover image

 2 X
M XN  2
1
MSE Xij  X0ij 1
M  N i1 j1

where Xij : the intensity value of the pixel in the cover image. X0ij : the intensity value of the
pixel in the stego image. M * N: size of an Image.
Table 4 shows a comparison of Mean Square Error for different hiding techniques with
respect to different image sizes. Figure 23 shows that the MSE values for LSB technique is
very less than that of DNA computing based steganography using HECC technique. In case
of the proposed scheme, DNA mapping is performed along with number mapping in the

123
An Improved Level of Security for DNA Steganography Using

Fig. 18 Binary value

mappingcover image

Fig. 19 XOR operation of

binary and cover image

embedding process and hence very large MSE is obtained with degrade on the cover image
quality.

5.6 Peak Signal to Noise Ratio (PSNR)

Peak Signal to Noise Ratio is defined as the ratio of peak square value of pixels by MSE
and is expressed in decibel. PSNR measures the statistical difference between the cover
and stego-image, is calculated using Eq. (2)
2552
PSNR 10log10 db 2
MSE

123
 P. Vijayakumar et al.

Fig. 20 HECC encrypted image

Fig. 21 Recovered secret image

Table 3 Comparison of embedding capacity

S. Image size LSB Image hides in DNA DNA Proposed
no (N 9 N 9 3) techniques another Image cryptography steganography steganographic
method

1 256 28,732 23,437 13,454 12,034 1543

2 512 93,424 80,223 74,543 62,394 5054
3 1024 394,828 294,323 104,532 90,453 67,893
4 2048 1,533,454 1,234,532 1,005,421 84,543 71,092

123
An Improved Level of Security for DNA Steganography Using

Embedding Capacity
1800000
Embedding Capacity in bits per
1600000
1400000 LSB technique
1200000
Image hidden within
1000000
pixel

another Image
800000 DNA Cryptography
600000
400000 DNA Steganography
200000
0 Proposed Steganographic
N = 256 N = 512 N = 1024 N = 2048 Method
Image size in bits

Fig. 22 Embedding capacity

Table 4 Comparison of Mean Square Error

S. no Image size LSB Image hides in DNA DNA Proposed
(N 9 N 9 3) technique another Image cryptography Steganography steganographic
method

1 256 5.74E-06 1.01E-09 6.75E-15 7.64E-04 9.44E-19

2 512 3.44E-10 6.82E-11 10.26E-21 1.22E-04 8.44E-25
3 1024 3.95E-13 3.33E-12 7.28E-25 2.10E-04 7.11E-29
4 2048 2.88E-16 2.10E-13 4.98E-29 1.10E-06 5.94E-35

Comparison of Mean Square Error

9.00E-05
8.00E-05 LSB technique
7.00E-05
Mean Square Value

6.00E-05 Image hidden within

5.00E-05 another Image
4.00E-05 DNA Cryptography
3.00E-05
2.00E-05 DNA Steganography
1.00E-05
0.00E+00 Proposed
Steganographic Method
Image size in bits

Fig. 23 Comparison of Mean Square Error

PSNR is the measure of the quality of the image by comparing the cover image with the
stego-image. The high value of PSNR indicates the good perceptual quality of stego-
image. The results of PSNR for all the techniques are shown in the Table 5. From the

123
 P. Vijayakumar et al.

Table 5 Comparison of Peak Signal to Noise Ratio (PSNR)

S. no Image size LSB Image hides in DNA DNA Proposed
(N 9 N 9 3) technique another Image cryptography Steganography steganographic
method

1 256 82.346 110.3456 117.453 121.1457 129.765

2 512 88.743 120.234 129.897 132.343 135.786
3 1024 91.235 131.567 139.654 142.159 152.159
4 2048 107.98 143.678 152.457 156.9766 166.9766

Comparison of PSNR
180

160

140
LSB technique
120
PSNR in dB

100 Image hidden within

another Image
80 DNA Cryptography
60
DNA Steganography
40

20 Proposed Steganographic
Method
0
N = 256 N = 512 N = 1024 N = 2048
Image size in bits

Fig. 24 Comparison of peak signal to noise ratio

simulation result shown in Fig. 24, it is inferred that the proposed steganographic method
has high PSNR value compared with other hiding techniques.

6 Performance Analysis

6.1 Computational Time Analysis

Table 6 tabulated the comparative results for computational time of the different hiding
techniques using ECC and HECC for key size of 82 bits. Figure 25 shows the comparison
result of ECC and HECC in terms of processing time for data size of 1024 bits and key size
of 82 bits. From the simulation results, it is inferred that ECC takes 30 % more processing
time for the encryption algorithm than HECC and 42 % increased processing time for the
decryption algorithm due to its larger key size.

6.1.1 Security Analysis

Hyperelliptic Curve Cryptosystem is the expansion of Elliptic Curve Cryptosystem having

genus g value greater than 1. The security of HECC is based on Hyperelliptic Curve

123
An Improved Level of Security for DNA Steganography Using

Table 6 Comparison of ECC

S. no Computations Processing time (ms)
and HECC
ECC HECC

1 DNA mapping 35 23
2 Binary mapping 12 08
3 XOR operation 44 32
4 Encryption 502 356
5 Decryption 452 273

Fig. 25 Comparison of ECC and Comparison of ECC & HECC

HECC
Processing time in milliseconds

600
ECC
500
HECC
400

300

200

100

0
DNA Binary XOR Encryption Decryption
Mapping Mapping operation

Operations

Discrete Logarithm Problem (HECDLP). In HECC, public and private key pairs are
generated by using scalar multiplication operation (i.e. repeated addition of points). For
example, the computation of public key Q with the help of private key d is given by
Q = d 9 P. Computing the value of Q is computationally feasible by knowing the value
of d and P. But the computation of d is infeasible inspite of knowing the value of Q
and P. This is termed as Hyperelliptic Curve Discrete Logarithm Problem. In addition to
HECDLP, the following security analyses are offered by HECC.

6.1.2 Key Size

Hyperelliptic Curve cryptosystem provides the same security level as Elliptic Curve
Cryptosystem with smaller key size. The key size of 80 bits length of HECC provides an
equivalent security level as that of 160 bit key size of ECC and it is more secure than RSA
with 1024 bits key size.

6.1.3 Ciphertext Only Attack

In ciphertext only attack, challenger tries to decrypt the chosen ciphertext using some
unknown key to the known encryption algorithm. Challenger also uses the previous result
to select the ciphertext with a secret key. As the secret key is not transmitted, the chal-
lenger cannot retrieve the original message from the ciphertext. Even if the challenger
knows the secret key, the challenger cannot produce the original plaintext as the resulting
cipher text consists of DNA nucleotide and binary digit mapping. Challenger finds it

123
 P. Vijayakumar et al.

difficult to decrypt the ciphertext due to Hyperelliptic Curve Discrete Logarithmic Problem
(HECDLP).

6.1.4 Dictionary Attack

In a dictionary attack, the challenger pretends to be a genuine user and attempts to login by
guessing different DNA nucleotide from a dictionary. As this is very difficult as huge
amount of DNA nucleotide is involved to make an encoded message. HECC protocol is
based on a DNA based HECC cryptosystem, so this type of attack is not applicable.

7 Conclusion

The proposed work is an attempt to suggest a highly secured data transmission using DNA
steganography. This has been proposed by showing the simulation results for image into
image steganography using DNA sequence. The immense storage capability of DNA
molecule makes it eligible to be utilized in wireless security application. From the simu-
lated results, it is inferred that the proposed method can encrypt and decrypt image files in
an efficient way. The reduced key size and limited cost, enhances its capability to be
implemented and efficient algorithm for image encryption.

References
1. Johnson, N.F., Duric, Z., Jajodia, S., & Memon, N. (2001). Information hiding: Steganography and
watermarkingAttacks and countermeasures. Journal of Electronic Imaging 10: 825. SPIE-Intl Soc
Optical Eng. doi:10.1117/1.1388610.
2. Nagaraj, V., Vijayalakshmi, V., & Zayaraz, G. (2013). Overview of digital steganography methods and
its applications. IJAST, 60, 4558.
3. Manoj, I. (2010). Cryptography and steganography. International Journal of Computer Applications,
1(12), 6368.
4. Artz, D. (2001). Digital steganography: Hiding data within data. IEEE Internet Computing, 5(3), 7580.
5. Swanson, M., Kobayashi, M., & Tewfik, A. (1998). Multimedia data-embedding and watermarking
technologies. Proceedings of the IEEE, 86(6), 10641087.
6. Torkaman, M.R.N., Nikfard, P., Kazazi, N.S., Abbasy, M.R., & Tabatabaiee, S.F. (2011) Improving
hybrid cryptosystems with DNA steganography. In Proceedings of the international conference on
digital enterprise and information systems, pp. 4252, Springer Book Pubisher, July 2022, 2011.
7. Hamed, G., Marey, M., El-Sayed, S., & Tolba, F. (2015) DNA based steganography: Survey and
analysis for parameters optimization. In Applications of intelligent optimization in biology and medi-
cine, vol. 96 of the series Intelligent Systems Reference Library, pp. 4789, Springer Publisher.
8. Tawalbeh, L., Mowafi, M., & Aljoby, W. (2013). Use of elliptic curve cryptography for multimedia
encryption. IET Information Security, 7(2), 6774.
9. Wollinger, T., Pelzl, J., & Paar, C. (2005). Cantor versus Harley: optimization and analysis of explicit
formulae for hyperelliptic curve cryptosystems. IEEE Transactions on Computers, 54(7), 861872.
10. Gehani, A., LaBean, T., & Reif, J. (2004) DNA based cryptography. In Aspects of Molecular Computing
Volume 2950 of the series Lecture Notes in Computer Science, pp 167188.
11. Beck, M., & Yampolskiy, R. (2012). DNA as a medium for hiding data. BMC Bioinformatics, 13(12),
A23.
12. Xiao, G., Lu, M., Qin, L., & Lai, X. (2006). New field of cryptography: DNA cryptography. Chinese
Science Bulletin, 51(12), 14131420.
13. Chakraborty, S., Roy S., & Bandyopadhyay, K. (2012) Image steganography using DNA sequence and
sudoku solution matrix. International Journal of Advanced Research in Computer Science and Software
Engineering 2(2), 117122.

123
An Improved Level of Security for DNA Steganography Using

14. Balado, F. (2013). Capacity of DNA data embedding under substitution mutations. IEEE Transaction on
Information Theory, 59(2), 928941.
15. Das, P., Deb, S., Kar, N., & Bhattacharya, B. (2015). An Improved DNA based dual cover steganog-
raphy. Elsevier Procedia Computer Science, 46, 604611.
16. Torkaman, M. R. N., Kazazi, N. S., & Rouddini, A. (2012). Innovative approach to improve hybrid
cryptography by using DNA steganography. International Journal on New Computer Architectures and
their Applications, 2(1), 224235.
17. Khalifa, A., & Atito, A. (2012) High-capacity DNA-based steganography. In Proceedings of interna-
tional conference on informatics and systems, pp. 7680.

P.Vijayakumar is currently working as Associate Professor in School

Electronic Engineering at VIT university Chennai campus, India and
completed Ph.D in Pondicherry University. He completed his B.Tech
in Rajiv Gandhi College of Engineering and Technology and M.Tech
in Pondicherry Engineering College which is affiliated to Pondicherry
University. He has 10 years of teaching experience. To his credit, he
has published more than 15 research papers relating to Cryptography
and Network Security in several National/International Journals and
Conferences. He can be reached by email at vijayrgcet@gmail.com.

Dr. V. Vijayalakshmi is currently working as Assistant Professor in

Electronics and Communication Engineering Department at Pondi-
cherry Engineering College, Puducherry, India. She completed her
B.Tech, M.Tech and Ph.D in Pondicherry Engineering College which
is affiliated to Pondicherry University. She has 20 years of teaching
experience. To her credit, she has published more than 25 research
papers relating to Network Security and software Engineering in
several National/International Journals and Conferences. She can be
reached by email at vijizai@pec.edu.

123
 P. Vijayakumar et al.

Dr. G. Zayaraz is currently working as Professor in Computer Science

& Engineering Department at Pondicherry Engineering College,
Puducherry, India. He received his Bachelors, Masters and Doctorate
degree in Computer Science and Engineering from Pondicherry
University. He has published more than twenty-five research papers in
reputed International Journals and Conferences. His areas of special-
ization include Software Architecture and Information Security. He is
a reviewer for several reputed International Journals and Conferences
and Life Member of CSE, and ISTE. He can be reached by email at
gzayaraz@pec.edu.

123