Image Masking and Compression Using User Private Key Generation

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org

Volume 3, Issue 5, September-October 2014
ISSN 2278-6856
Image Masking and Compression Using user

Private Key Generation
G. Thippanna1, Dr. T. Bhaskara Reddy2, Dr. S. Kiran3
1
Research Scholar, Sri Krishnadevaraya University, INDIA.
Resersch Supervisor and HOD, Dept. of Computer Science & Technology, S.K. University, INDIA.
3
Assistant Professor, Y.V. University, INDIA
ABSTRACT
With the increasing application of image processing
techniques in various areas contrast techniques in digital
image processing systems concepts. Unsharp image masking is
the one of the efficient approach technique in Among the
availability of image compression methods, which could gives
satisfactory results. However, accurately setting the unsharp
masking algorithmic parameters is a difficult task. In this
paper random number generation phases made the image in
unrecognized format. The property of this entitled is to
increase the security levels of the encrypted encoded image.
Here one key is needed to encrypt and decrypts the image, and
then we had to applied compression techniques for a better
compression and to prepare unrecognized and unreadable
format. Finally the Experiments are conducted to demonstrate
the feasibility of the security is providing to the image in
network security.
Keywords: - Raw Images, Image Encryption Technique,

decryption technique, Compression techniques and
Random key.
1. INTRODUCTION
The term cryptography is information security and the
processes of writing / reading secrete massages / code. This
term cryptography is way to conceal the information in
storage. It is personally related to restraints of cryptology
and cryptanalysis. Here we will try to learn the basics of
cryptography. Simply technique to encode the information
or code into unreadable formal. Computer security has to
reinvent itself. New technologies and new applications
bring new threats. Above all with the growth of data a
communication cryptography and data security are the
necessary requirements for communication isolation. The
entitled Image Masking and Compression Using Random
Number Generation of this paper is to increase the
security levels of the encrypted encoded image. Here one
key is needed to encrypt and decrypts the image, and then
we had to applied compression techniques for a better
compression and to prepare unrecognized and unreadable
format. Finally the Experiments are conducted to
demonstrate the feasibility of the security is providing to
the image in network security.
2. The Basic Principles

Encryption
Encryption is process the data or code has to convert into
unreadable format. This processor is helps in protecting
the privacy while sending the data from source to
destination. But at destination side the data decrypts and
bought it back as its original. The process of reverse of an
encryption is called decryption. This notion like encryption
and decryption techniques needs some extra information
for encrypting and decrypting the information. Such typed
information is known as key. Here different types of keys
are available to decrypts the encrypted data.
Authentication
Authentication is another important principle of
cryptography. This is making sure that the idea was
originated from the originator claimed in the
communication.
Presume,
dispatcher
dispatches
information to receiver and now receiver wants evidence
that idea has been certainly sent by dispatcher. This can be
made possible if Alice performs some action on message
that receiver knows only sender can do.
Integrity
The chief aim of this concept is in the cryptography is the
excellence of being honest and having strong moral values.
This means that Cryptography should ensure that the
messages that are received by the receiver are not altered
anywhere on the communication path. This can be
achieved by using the concept of cryptographic hash.
Non Reputation
What happens if Alice sends a message to Bob but denies
that she has actually sent the message? Cases like these
may happen and cryptography should prevent the
originator or sender to act this way. One popular way to
achieve this is through the use of digital signatures.
2.1. Types of Cryptography
In the There are three types of cryptography techniques:
They are
Secret key Cryptography
Public key cryptography
Hash Functions
Page 262

ISSN 2278-6856
2.1.1. Secret Key Cryptography

One key is used in this technique. This one key is used by
the applicant/sender to encrypt the image; later the
receiver/applicant used this key to decrypt the image, i.e.
in both sides the single key is used for the purpose of
encrypts and decrypts the image. Hence the sender later
encrypts the image by single key he send the key to
receiver, then the receiver uses this key to decrypts the
image.
pic 3. Hash Functions
1.3. Methods of Cryptography
pic. 1. Secret Key Cryptography
But its a biggest problem with this technique is the

distribution of key as this algorithm makes use of single
key for encryption or decryption.
2.1.2. Public Key Cryptography
pic. 2. Public Key Cryptography

Here, two keys are used in this type of cryptography
techniques, one key is used in between sender and retriever
involves providing to secure the information to send.
Another one is used in between retriever and sender used
to insecure the data. Since the pair of keys is applied here
so this technique is also known as asymmetric encryption.
In this method, each party has a private key and a public
key. The private is secret and is not revealed while the
public key is shared with all those whom you want to
communicate with. If Alice wants to send a message to
bob, then Alice will encrypt it with Bobs public key and
Bob can decrypt the message with its private key.
2.1.3. Hash Functions
This technique does not involve any key. Rather it uses a
fixed length hash value that is computed on the basis of the
plain text message. Hash functions are used to check the
integrity of the message to ensure that the message has not
be altered, compromised or affected by virus. So we see
that how different types of cryptography techniques
(described above) are used to implement the basic
principles that we discussed earlier. In the future article of
this series, well cover more advanced topics on
Cryptography.
Which cryptography method is the best? It depends on

what the intent for the cipher is and how concerned you
are that it may be broken. In this article I will discuss the
different methods and help you determine which is best
suited for your needs. Cryptography methods range from
the simple to the complex. Simple methods of
cryptography include the substitution (or Caesar's
Alphabet) method. Reciprocal methods include the Enigma
machine that the Germans used in World War II.
Symmetrical and Asymmetrical methods came along later
and are still in use today.
Substitution Methods
The substitution method, or Caesar's Alphabet, is
exactly what its name implies. The letters of the
alphabet are either slid over a certain number of
spaces (for example ABC becomes DEF) or are
substituted for numbers or symbols (ABC for 123 or
ABC for #*%). The main problem with this method is
that the cipher is easily cracked. These methods are
commonly seen in the newspapers in the puzzles
section, but are not used for really secure
communications.
Reciprocal Methods
The reciprocal method works like this. The plaintext is
inputted into a machine that creates the cryptograph.
The letters are "flipped" in pairs. For example, if "C"
is substituted with "L", then any "L" in the plaintext
will be substituted with "C" in the cipher. While this is
more secure than plain substitution, if the cipher is
entered into the same type of machine (with the same
key), it will output the plaintext--without any work on
the part of the person trying to read it.
Symmetric Method
Symmetric methods are also known as single key
ciphers. There is one key that is used to encrypt and
decrypt the plaintext. The key needs to be passed on to
the recipient. Also the fact that there is one key (or in
some cases the two keys are directly related to each
other), the key can be broken. Two variations of this
are block cipher and stream ciphers. The stream is one
bit of plaintext at a time, whereas the block is a
number of bits at once. An example of symmetric keys
is Data Encryption Standard (DES).
Asymmetric Method.
Page 263

The Asymmetric method is also known as a public-key
method. The key holder has two keys--a private key
(which only they know) and a public key (which is
uploaded to a key server or given to people they want
to correspond with). When a person wants to encrypt a
message or file, they use the Public key of the recipient
to encrypt it. This ensures that only the recipient (or
anyone with the private key) can read the message or
file. If the sender wants to guarantee that they were
the sender, they will use their private key to sign the
message (and the recipient will use their public key to
verify that it was sent by them). PGP and its opensource variation (Open GPG) are examples of
asymmetric keys.
Final Thoughts
One more important factor is key-length. While it is
not a method, it still needs to be taken into
consideration. The longer the key-length means the
probability of a person cracking the key increases
exponentially with the increase in bits. For example, a
2-bit encryption has four possibilities, so a 128-bit has
2128 possibilities. It is important to pick the strongest
method and the largest key possible.
ISSN 2278-6856
3.2. Reverse Technique of proposed method.

The following steps explained about the reverse processor
technique of the proposed work. In this reconstruct the
image from above approach method we should take already
Encrypted and compressed image as a source image,
uncompress the compressed image first, on this
uncompressed image apply reverse shift operations,
generate random number key and we get a digital
formatted image and make it as original raw image. But
here at the time reconstruction image it lose some
information, that even eye may not considered, but we
found it at comparison state of both images i.e. source
image and reconstructed image.
Step1. Take already encrypted and compressed image as
an input file.
Step2. Apply reverse Huffman compression technique on
what you took an input file, then the resultant
image shows as the mask image.
Step3. Apply reverse shifted operation.
Step4. Suppurate random key then form a digitized image.
Step5. From digitized formation make source image.
3. PROPOSED METHOD.
3.1. Forward Technique of proposed method
The following steps explained about the forward processor
technique of the proposed work. As there is no header for
raw images and easy to apply any techniques on this to get
a better results. In this method, raw images considered as a
source input image. Convert this source image into the
digital format. Create a key using random generation
technique. Apply the shift operation on digital format of
source image along with this key. By this we get the
encoded image. This format of image is called cipher
image, this is hiding information in unreadable format.
Simply encrypted format. To reduce the size encoded
image compressed the image using Huffman compression
technique. By this we get less size of image i.e. size
reduced image and it is also helps to easily transfer even
though through the low bandwidth network also as easily
and firstly.
Step1. Consider raw image as an input file.
Step2. Convert input raw image into digitized form.
Step3. Generate Random Number
Step4. Apply shift operation on input image along with
random number to generate mask image.
Step5. Apply compression technique on masked image to
generate compressed image
pic. 4 Foreword processor of proposed method
pic 5. Reverse Technique of proposed method
4. Results
For this, an experimental analysis is one with the different
raw images whose resolution is in different sizes. In this
paper random number generation phases made the image
in unrecognized format. The property of this entitled is to
increase the security levels of the encrypted encoded
image. Here one key is needed to encrypt and decrypts the
image, and then we had to applied Huffman compression
technique for a better compression and to prepare
unrecognized and unreadable format. Finally the
Experiments are conducted to demonstrate the feasibility of
the security is providing to the image in network security.
This method gives a better result than JPEG, BMP and
TIFF, but few of image formats are better than of proposed
method based on pixel intensity.
Original Image
cipher image retrieved image
Pic. 5 differences among different images in techniques
Page 264

ISSN 2278-6856
In this proposed the information is lossy, but the eye is

cant find the difference between original and retrieved.
The followed tables and graphs gives analyzed and
compared information about proposed content with existed
techniques
Table: 1. Comparison study of proposed method
among different compression methods
Graph 3: Comparison study of proposed saving

percentage among different images formats saving
percentage
To calculate the compression ratio by
equation and proposed technique is compare with different

compression technique, which is given better results than
of existed techniques.
Table 3: Comparison study of proposed saving percentage
among different images formats saving percentage
Grapg:1. Show Comparison study of proposed method

among different compression methods To calculate the
saving percentage by
equation, and proposed technique is compare with different

compression technique, which is given better results than
of existed techniques.
Table: 2. Comparison study of proposed compression rate
among different image format compression rates.
S
no
1
2
3
4
5
6
7
Image
Name
Baboon
Brain
Lena
Madhuri
Pepper
Head Scan
Shoulder
Jpeg SR
-0.75629
-0.40967
-0.17099
-0.36353
-0.36017
-0.24358
-0.16938
TIFF
SR
-0.66479
-0.74592
-0.48623
-0.57324
-0.57764
-0.59616
-0.54974
Propose
saving Ratio
0.100952
0.270658
0.09346
0.109314
0.096436
0.125312
0.23594
Graph 3: Comparison study of proposed saving

percentage among different images formats
saving percentage
When we observed the above the data the proposed
technique is given better results than existed compression
techniques.
Page 265

ISSN 2278-6856
5. Conclusion
experience, til now 4 international papers.
In this paper, we propose a lossy compression scheme for

pixel-value encrypted images. The main contribution of
our work is shows as:
The experimental results shows in sizes and
compression rates that our proposed scheme achieves
much better performance than the existing lossy
compression scheme for pixel-value encrypted images,
and also achieves similar performance as the state-ofthe-art lossy compression on the pixel permutationbased encrypted images.
Dr. T. Bhsakara Reddy, Associate

Professor.
Department of Computer
Science and
Technology at S.K
University, Anantapur A.P. He holds the
post of Deputy Director of Distance
education at S.K. University and He also
the CSE Coordinator of Engineering at S.K. University. He
has completed his M. Sc and Ph. D in computer science
from S.K. University. He has acquired M. Tech from
Nagarjuna University. He has been continuously imparting
his knowledge to several students from the last 17 years.
He has published 47 National and International
publications. He has completed major research project
(UGC). Four Ph. D and Three M. Phil have been awarded
under his guidance. His research interests are in the field
of image Processing, computer networks, data mining and
data ware house.
References
[1] X Zhang, Lossy Compression and Iterative
reconstruction for Encrypted Image. IEEE Trans. on
Inf. Forensic Secur 6(1), 5358 (2011).
[2] M. Naor and A. Shamir, Visual cryptography,
Advances in Cryptology-Eurocrypt94, 1995, pp. 1
12.
[3] Hossam El-din H. Ahmed, Hamdy M. Kalash, and
Osama S. Farag Allah , An Efficient Chaos-Based
Feedback Stream Cipher (ECBFSC) for Image
Encryption and Decryption, Informatica 31 (2007)
121129
[4] Chang C, Hwang M, Chen T, A new encryption
algorithm
for
image
cryptosystems.JSyst
Software;58:8391, science, vol. 809, Springer,
Berlin; 1993. p. 7182, 2001.
[5] Z. Shang, H. Ren, and J. Zhang, A block location
scrambling algorithm of digital image based on
Arnold transformation, In: Proc. of the 9th
International Conference for Young Computer
Scientists, pp.29422947, 2008.
[6] X. Zhang, Lossy compression and iterative
recobstruction for encrypted image, IEEE Trans. Inf.
Forensics Security, vol. 6, no. 1, pp. 5358 Mar. 2011
[7] R. El Sawda, A. Alfalou, G. Keryer and A. Assoum.
Image Encryption and Decryption by Means of an
Optical Phase Mask. Proceeding of IEEE (ICTTA06IEEE), Page(s): 1474-1477,Vol. 1, 24-28 April, 2006.
[8] R. C. Gonzalez and R. E. Woods. Digital Image
Processing. Prentice-Hall edition, ISBN: 0-13-094650, 2002.
[9] Juan M Vilardy, J. Useche, C. O. Torres and L.
Mattos, Image encryption using the fractional wavelet
transform, Journal of Physics: Conference Series 274
(2011) 012047.
[10] A. Mitra, , Y V. Subba Rao, and S. R. M. Prasnna, "A
new image encryption approach using combinational
permutation techniques," Journal of computer Science,
vol. 1, no. 1, p.127, 2006, Available:
http://www.enformatika.org
Dr.S.Kiran is an Assistant Professor in the department of

Computer Science and Technology at Yogivenama
University , Kadapa, A.P. He has completed his M.Sc and
Ph.D in computer science from S.K. University. He has
acquired M. Tech from Nagarjuna University. He has been
continuously imparting his knowledge to several students
from the last 5 years. He has published 4 National and
International publications.. His research interests are in the
field of image Processing, computer networks, data mining
and data ware house.
Author contributions
Mr. G. Thippanna, Research Scholar (Ph.D.).
He has completed his Post Graduation in 2008
from S.V. University, Tirupati. He 4 years of
teaching experience and 4 years of research
Page 266

Image Masking and Compression Using User Private Key Generation

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Image Masking and Compression Using User Private Key Generation

Uploaded by

Copyright:

Available Formats

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org