Enhanced Cipher Image Generation Using Nibbles and Zigzag Patterns

International Journal of Engineering Trends and Technology (IJETT) Volume 4 Issue 8- August 2013
ISSN: 2231-5381 http://www.ijettjournal.org Page 3563

Enhanced Cipher Image Generation Using Nibbles and Zigzag Patterns
1
M.srinivasarao,
2
D.srinivasulu
1
M.tech student, st.ann'scollege of engineering&technology
2
assoc professor, st.ann'scollege of engineering&technology

Abstract: Today data protection is very
essential and main concern issue. As the
communication in now a days has been
increasing rapidly through mobile phones,
televisions and web there is need of providing
security to the data to be transmitted.
Information exchange is must in any
communication field like military, defense
applications. As the data to be transmitted
must be highly secured and confidential we
need to protect the data from the hackers. The
technique employed to provide the data
security is encryption. Here we employ an
effective fractional encryption method based
on SCAN patterns and selecting a pixel value
of rearranged mapping image based on the
mapping function.
Keywords: Encryption, Decryption, SCAN
language, DCT, Image processing
Introduction: In the digital world today, the
protection of digital images becomes more
and more significant, since the
communications of digital products over
networks occur more and more recurrently.
Let us consider transferring of an image
through the network which needs more
attention while delivering the data. We make
sure that every thing is secured in the
transmission. Encryption is the process of
converting the known data format into
unknown data format. Nowadays, image
encryption schemes have been increasingly
developed to meet the requirements for
secure transmission over the communication
channels. However there are several image
encryption methods, each of them having
their own strength and weakness.
Classification of the image encryption
methods in to three major types: position
permutation, value transformation and visual
transformation. In this paper we do the
encryption partially on the image which saves
time of execution and complexity. We have
presented a new methodology which
performs both lossless compression and
encryption of binary and gray-scale images.
The compression and encryption schemes are
based on SCAN patterns generated by the
SCAN methodology. The SCAN is a formal
language-based two-dimensional spatial
accessing methodology which can efficiently
specify and generate a wide range of
scanning paths or space filling curves.
Principles of encryption: In a simplest form,
encryption is to convert the data in some
unreadable form. This helps in protecting the
privacy while sending the data from sender to
receiver. Cryptography has become one of

the main tools for privacy, trust, access
control, electronic payments, corporate
security, and countless other fields. Strong
encryption is the kind of encryption that can
be used to protect information of real value
against organized criminals, multinational
corporations, and major governments. In
encryption terminology, the message is called
clear text. Coding the contents of the message
in such a way that hides its contents from
outsiders is called encryption. The encrypted
message is called the cipher text.
Cryptography is the art or science of keeping
messages secret. Cryptanalysis is the art of
breaking ciphers, i.e. retrieving the plaintext
without knowing the proper key. There are
two classes of key-based encryption
algorithms, symmetric and asymmetric
algorithms. The symmetric key algorithms
uses same key for both encryption and
decryption where asymmetric algorithms uses
different keys at encryption and decryption.
Strong cryptographic algorithms are designed
to be executed by computers or specialized
hardware devices. In most applications,
cryptography is done in computer software.
Here we discuss about different algorithms in
encryption. Data Encryption Standard this is
a cipher that operates on 64-bit blocks of
data, using a 56-bit key. The algorithm is best
suited to implementation in hardware. A 'hash
algorithm' is used for computing a condensed
representation of a fixed length message/file.
RSA is the algorithm that uses different keys
for encryption and decryption. AES is a
symmetric key algorithm which uses same
key for both encryption and decryption.
Block diagram of encryption and
decryption:

The above block diagram shows the basic
building blocks of encryption and decryption
which converts the user understandable data
into unknown format and vice versa with the
help of encryption and decryption algorithms.

Advantages of encryption:
Individuality Theft avoidance.
Secure Decommissioning of
Computer.
Unauthorized entre Protection.
Designing of system: The SCAN is an
official language-based two dimensional
spatial accessing methodology which can
symbolize and produce a large number of
wide varieties of scanning paths. This
method converts a 2D image into a 1D list,
and employs a SCAN language to describe
the converted result. In this language, there
Original
data
Encrypted
data
Key
Key
Original
data

are several SCAN letters. Each SCAN
letter represents one kind of scan array.
Different kinds of combinations of SCAN
letters may produce different kinds of
furtive images. The SCAN is a family of
formal languages such as Simple SCAN,
Extended SCAN, and Generalized SCAN,
each of which can represent and generate a
specific set of scanning paths. After
determining the combination of SCAN
letters, the scheme then generates a SCAN
string. This string defines the scan order of
the original image. Scanning of a two
dimensional array is an order in which each
element of the array is accessed exactly
once. Following by basic scan patterns and
partition patterns to produce concept, we
use a random code generating produce the
SCAN word and to define encryption key.
The SCAN word contain scan and partition
patterns.
Various algorithms have been proposed to
encrypt images. Most image encryption
algorithms are based on position
permutations with or without confusion
functions in which the pixel values are
jumbled to different positions on the 2D
array. The other algorithms are based on
confusion transformations where disordered
binary sequences are generated for the
reorganization of the image pixels, on tree
structures where the pixel values are
converted by using certain functions, or on
other methods like the quantization based
approaches. Furthermore, many image
encryption algorithms have been
implemented in software, due to the resulting
flexibility and the algorithm complexity. This
means that most of these algorithms are good
for non real- time image encryption but not
for compressed video encryption. Very few
extensively used image encryption algorithms
have been implemented in hardware, and
generally in conjunction with image
compression. On the other hand, many block
cipher, which are used for encrypting text
data, have been used to encrypt images. In
reality, SCAN is a class of formal languages,
which can be applied to compression,
encryption, data hiding, or combinations
thereof. The SCAN family of general
languages includes several versions such as
Simple SCAN, Extended SCAN, and
Generalized SCAN, each of which can
represent and produce a specific set of
scanning paths. Each SCAN language is
defined by a grammar and each language has
a set of basic scan patterns, a set of
transformations, and a set of rules to create
simple scan patterns, which in turn are used
to obtain complex scan patterns. A scanning
of a two dimensional array is an order in
which each part of the array is accessed
exactly once. The SCAN is a formal
language-based two dimensional spatial
accessing methodology which can represent
and produce wide variants of scanning paths.


DCT: DCTs are significant to many
applications in science and engineering, from
lossy compression of audio and images (e.g.
J PEG) to spectral methods for the numerical
solution of partial differential equations. A
discrete cosine transform (DCT) expresses a
finite sequence of data points in terms of a
sum of cosine functions oscillating at
different frequencies. In particular, a DCT is
a Fourier-related transform analogous to the
discrete Fourier transform (DFT), except
using only real numbers. The most common
variant of discrete cosine transform is the
type-II DCT, which is often called simply
"the DCT", its inverse, the type-III DCT, is
correspondingly often called simply "the
inverse DCT" or "the IDCT". The DCT, is
widely used in signal and image processing,
especially for lossy data compression,
because it has a strong "energy compaction"
property.
The DCT can be computed on the encrypted
pixel values by relying on the
homomorphism properties and the fact that
the DCT coefficients are public. However,
this needs several issues to be satisfied. The
foremost thing is that we should represent the
pixel values, the DCT coefficients, and the
transformed values in the domain of the
cryptosystem, i.e., as integers on a finite
field/ring. One more difficulty is that
encrypted values can not be scaled or
truncated by relying on homomorphism
computations only. In general, for scaling the
intermediate values of the computation we
should allow two or more parties to interact.
However, since we would keep the DCT as
simple as possible, it is preferable to avoid
the use of interactive protocols. A final
setback is that encrypting each pixel
separately increases the size of the encrypted
image and affects the complexity.
Image compression: Digital images are very
large in size and occupy more bandwidth
while uploading to the web, to combat this
problem user has to reduce the size of the
digital image with out degrading its quality.
Image compression plays a key role in image
processing where the channel capacity is the
main concern. Image compression is the
novel method to reduce the size occupied by
the image when we are transmitting through
the band limited channel. The main motto of
the image compression is to reduce the
redundancy and irrelevant data in the
transmitted image.
Image compression can be done in two ways
lossy and lossless. In lossy compression
technique user should compromise in the data
quality and we may loss some useful
information, lossy methods are especially
suitable for natural images such as
photographs in applications where minor
(sometimes imperceptible) loss of fidelity is
acceptable. In the case of lossless
compression we get the maximum
information with out any compromises in the
quality of the data. With the implementations

of compression algorithms we can send more
data through the same channel at different
time instants without any disturbance among
the data packets. We can employ region of
interest coding method to encode and
compress any particular part of the image
effectively. As we send more data packets
through the channel it increases the bit rate of
the channel. Bit rate tells how many are
transmitted through the channel in the given
time period. It is the ration of bits per second
(bits/sec).
Basically there are two standards in image
compression J PEG and MPEG. J PEG deals
with the still images while MPEG is
associated to the video sequences. Generally
we use DCT method followed by
quantization to reduce the size of the image.
Compression ratio varies from technique to
technique. In the ordinary J PEG algorithm
the image is divided into 88 blocks, these
blocks are converted from the spatial to the
frequency domain by the Discrete Cosine
Transform (DCT). Then, each DCT
coefficient is divided by its equivalent
constant in a standard quantization table and
rounded down to the nearest integer. After
this step, the DCT quantized coefficients are
scanned in a predefined zigzag order to be
used in the final step, the lossless
compression.
Image data reduction:
Decrease color nuances within the
image.
Decrease the color resolution with
respect to the prevailing light intensity
Remove small, invisible parts of the
picture
Advantages:
We can upload the images very speedily
into the web.
They use less space in web hosting.
They take very less time to host.
Sharing of files can be easy with
compression.
Image compression does not decrease the
physical size of an image but compresses the
data that makes up the image into a smaller
size.
DCT process on image:
Take the input image and resize it.
Segment the image into 8x8 blocks.
Reduce the higher intensity values from the
image.
Consider a quantized matrix with quantized
values.
Divide the image with the quantized matrix.
Procedure of encryption:
We perform the partial encryption of the
image as follows.
Step 1: select an input image to be
transmitted and take a combine value.
Combined value defines the level of
encryption.

Step 2: select a mapping image and rotate it
by some angle.
Step 3: perform encoding of an image which
consists the following steps.
Segment the image with DCT and reduce
the higher values in the image.
Generate the nibbles and zigzag pattern
from the image.
Combine all these to get the transformed
form of the image.
Step 4: to retrieve the image we do the
reverse operations such as IDCT and inverse
zigzag operations. Finally the resultant image
is stored as restored image.
The following diagram shows the procedure
to generate a secret image by using DCT and
SCAN patterns. We generate partially
encrypted image through this process.

Flow diagram:

Results:

Select the input
image
Select mapping
image & rotate
with an angle
Reduce the
higher values
from the image
Apply DCT
with quantized
matrix
Generate
nibbles &
Transmit the
image

Advantages:
We can keep our data more securely from
the unauthorized persons.
The system which we employ is easy to
use.
Generation of key (patterns) is easy as we
are generating from image it self.
The partial encryption saves the time and
complexity of the process.
Applications: As the technology is growing
rapidly we must provide the security for the
data. We can employ the encryption methods
in cellular technology, television
broadcasting, military and defense
applications. We can employ these
encryption methods where the channel
capacity is limited.
Conclusion: In this communication, new
ways of image encryption scheme have been
proposed which utilizes SCAN patterns. This
paper has presented a concept of combination
of nibble value of a pixel is used as a
mapping function. This Encryption uses only
integer arithmetic and it can be easily
implemented in the hardware. we conclude
with the remark that the method is expected
to be useful for real time image encryption
and transmission applications.

References:
[1] Data Privacy and Security: Encryption
and Information Hiding By David Salomon.
[2]Computer security and the data encryption
standard ... Volume 500, Issues 1-6 By
United States Civil Service Commission,
United States. National Bureau of Standards.
[3]Multimedia Content Encryption:
Techniques and Applications By Shiguo
Lian.
[4]Multimedia Encryption and Authentication
Techniques and Applications By Borko
Furht, Darko Kirovski.
[5]Applied Cryptography for Cyber Security
and Defense: Information Encryption by Li
yang.

[6]Computational Intelligence in Information
Assurance and Security edited by Nadia
Nedjah, Ajith Abraham, Luiza De Macedo
Mourelle.
[7]http://www.computer.org/csdl/proceedings
/iv/2004/2177/00/21770217-abs.html.
[8]http://www.docstoc.http://www.researchm
anuscripts.com/isociety2012/46.pdf
[9]http://www.docstoc.com/docs/50227726/S
electiveImageEncryptionUsing-DCT-with-
Stream-Cipher.

Enhanced Cipher Image Generation Using Nibbles and Zigzag Patterns

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Enhanced Cipher Image Generation Using Nibbles and Zigzag Patterns

Hochgeladen von

Copyright:

Verfügbare Formate

International Journal of Engineering Trends and Technology (IJETT) Volume 4 Issue 8- August 2013

ISSN: 2231-5381 http://www.ijettjournal.org Page 3563

Das könnte Ihnen auch gefallen