International Journal of Emerging Technology in Computer Science & Electronics (IJETCSE)

ISSN: 0976-1353 Volume 14 Issue 2 APRIL 2015.

PERFORMANCE ANALYSIS OF IMAGE

USING RSA ALGORITHM AND VISUAL
CRYPTOGRAPHY
MAHENDRA D M, REVATHI S NADUVINAMANI, SUMIT PATIL, AMITKUMAR ALAGURE,
BE Students, Department of Electronics and Communication Engineering Bahubali College of Engineering,
Shravanabelegola,Karnataka, India

[email protected], [email protected],
[email protected], [email protected]
RSA involves public key and private key
can be known to everyone and is use for encrypting
Abstract: Biometric is used for authentication. The
messages. Messages encrypted with the public key
Biometric word is come from the two separate words
bios and metrics i.e. Greek words. That means for
can only be decrypted using the private key.
life measure .Biometric cryptography were developed
to obtain security and privacy. Biometric Systems
consists of the physical and behavioral features for e.g.
face, fingerprint, iris, DNA, retina etc. visual
cryptography is a special technique which is used to
send the images securely over the network. Visual
cryptography is a cryptographic technique which allows
visual information to encrypt in such a way that
decryption will be take place. In this paper a new
approach to protecting biometric templates with image
watermarking techniques is used. A secrete image is
divided in two shares that are stored in two separate
database servers such that the secrete image can be
recovered only when both shares are simultaneously
available at the same time, the single share cannot be
recover the density of secrete image. The stored images
are encrypted during verification that images are
decrypted. In RSA algorithm public key is used for
encryption and private key is used for decryption.

Visual cryptography is explored to protect

the privacy of image data, in visual cryptography first
the private image is decomposed into two image in
such a way that the original image can be obtained
only when both the image are available.
The rest of the paper is organized as follows: a brief
introduction of visual cryptography is presented in
section 2, some steps of visual cryptography are
discussed in section 3, visual cryptography scheme is
presented in section 4,Advantages are discussed in
section 5, RSA Algorithms are discussed in section
6,Steps of RSA algorithm are discussed in section 7,
and finally section 8 gives the conclusion.
II.

Visual cryptography

Cryptography is the art of sending and

receiving encrypted messages that can be
decrypted only by the sender or the receiver.
Encryption and decryption are accomplished by
using mathematical algorithms in such a way
that no one but the intended recipient can decrypt
and read the message.
(a) Purpose
When we transmit data(image) over the
network, then any unauthenticated person can
read our data (image). So in order to provide the
security to data (image) generally the sender will
encrypt the data(image) and then send it to the
intended person and the receiver will decrypt that
encrypted data(image) and uses it. Visual
cryptography comes with the guarantee of the
security by means of defining perfect secrecy.
Usually, a set of players(attackers) are not
allowed to learn any information about the

Keywords: Biometric, face image, visual cryptography and

RSA.

I.

INTRODUCTION
In current times identity of a person is what
matters the most so in accordance with that we are
proposing a concept "Visual Cryptography for
Biometric Analysis under which we are providing
security to the images. We are implementing this
project to provide secure way to send and receive the
images which are of critical importance to us.
Biometric systems have greater importance
for information security systems. Thus devising a
better security system for such applications would be
a need for the day. We are using RSA and Visual
Cryptography (VC) for database protection
of Image Authentication systems.

209

International Journal of Emerging Technology in Computer Science & Electronics (IJETCSE)

ISSN: 0976-1353 Volume 14 Issue 2 APRIL 2015.
(one)secret image even under the possibility of
collusion.

illustrated in Table I. If p is white, one of the first two

rows of Table 1 is chosen randomly to encode A and
B. If p is black, one of the last two rows in Table 1 is
chosen randomly to encode A and B. Thus, neither A
nor B exposes any clue about the binary color of p.
When these two shares are superimposed together,
two black sub-pixel sappear if p is black, while one
black sub-pixel and one white sub-pixel appear if p is
white as indicated in the rightmost column in Table
1. Based upon the contrast between two kinds of
reconstructed pixels can tell whether p is black or
white.

(b) Proposed
In the Visual Cryptography, There are some
algorithms for encrypting and decrypting the
images. In this paper we are using one secret
image and two cover images, Then the secret
image and cover images are overlapped with
each other. And if both the cover images are
simultaneously available then only we can access
the secret image. The single share cannot give
any data (information) about the secret image.
We are using "Floyd Steinberg Error Diffusion"
Algorithm for Half toning an input image and
Converts into Gray scale image of the range 0255 scale into the much smaller scale like all of
the pixels in an image will be either 0,
80,120,150,170,225,255 only. We are using
BBR Algorithm for process of Encryption and
the process of decryption is an OR operation of
the project. So when pixel values are at defined
positions that are read from the two shares and
the minimum of the two is selected as pixel
value of secret image.

III.

The Visual cryptography is done by the

following steps

Embedding Algorithm:
1. r = |c| mod R
2. (c) = c-(c/ |c|)*r
If(w=1) then
d=(R-1)*(3/4)
else
d=(R-1)/4
3. c = (c)+(c/|c|)*d

(c) Gray Scaling

Visual Cryptography is not work for the color
images. It only works for the black and white images.
So that we are using Gray scaling method for
converting the color images into grayscale images.
For biometric privacy, here 2-out-of-2 scheme is
using. TABLE I

Extracting Algorithm
1. r=|c| mod R
2.

TABLE I: Encoding a binary pixel P into 2 shares

A and B

if r>= (R-1)/2 then

p =1
else
p = 0

IV.

VISUAL CRYPTOGRAPHY SCHEME

There are a few basic definitions which need
to be provided before formally defining the VCS
model and its extensions.
1. Secret image: The original image that has to
behidden. In our application, this is the private
biometric image.
2. Hosts: These are the face images used to encrypt
the secret image using the GEVCS[5].In our
application.
3. Sheets: The secret image is encrypted into n sheet
images which appear as random noise images (inthe
case of (k, n) VCS) or as a natural host image(in the
case of GEVCS).
4. Target: The image reconstructed by stacking or
superimposing the sheets.

In this scheme for sharing a single pixel p, in

a binary image Z into two shares A and B is
210

International Journal of Emerging Technology in Computer Science & Electronics (IJETCSE)

ISSN: 0976-1353 Volume 14 Issue 2 APRIL 2015.
5. Sub pixel: Each pixel P is divided into a certain
number of sub pixels during the encryption process.
6. Pixel Expansion: Shares, each pixel is encrypted
by n collections of m black-and-white sub pixels.
These collections of sub pixels are known as shares.
7. Relative Contrast: The difference in intensity
measure between a black pixel and a white pixel in
the target image. OR-ed -vector: An n x m matrix is
transformed to an m-dimensional vector by applying
the Boolean OR operation across each of the m
columns.
8. Hamming weight: The number of 1 bits in a
binary vector.
V.

VI.

Advantage
1) No Pixel Expansion, The size of original
image is as it is.
2) High Level Security for biometric privacy.
3) Prevent Attacks of biometric images.
4) Secure Databases.

Figure 1- Attack on biometrics

RSA Algorithm
a.

RSA algorithm is used for Public key

Cryptography which is based on the presumed
difficulty of factoring large integers. RSA confirms
Encryption and Digital Signatures. It is universally
used public key algorithm and gets its security from
integer factorization problem. RSA is easy to
understand and implement and also used in security
protocols like IP data security, transport data security,
email security, terminal connection security and
many more. RSA apply two different keys with a
mathematical relationship to each other. Their
protection depends on the premise that knowing one
key will not help you to figure out the other. For
example, we multiply two large numbers together
and form a product. But we cannot guess two original
numbers from that product, or cannot guess one
number if other is known. In RSA algorithm the
public key and private keys are carefully generated
and they are used to encrypt the information [2].
Section II describes various attacks and existing
work. Proposed system with RSA is presented in
section III. Section IV describes conclusion and
future work.

Encryption module

In Encryption module we encode biometric

code by making a public key, and by using this
key we send a message. For that first person
selects two prime number say x and y, that
person multiply xy which we called public key.
Again he selects one number z which is nearly
prime to(x-1)(y-1) and is a part of public key.
Second person also know about value z. he has
enough knowledge for encoding message A.
Second person calculates value of,P=Az(mod B)
Here B=xy which we want to send.
b. Decryption module
In RSA decryption module we decode
multibiometric code. For that we have to find a
number w such that, zw = 1 mod(x-1)(y-1) (2)
Then calculate, Pw(mod B) here B=xy that
calculated value is original biometric code
VII.

211

The RSA encryption is done by the

following steps
Select two relatively large prime numbers p
and q.
Multiplies p and q together to get N.
N=pq where N is the public key.

International Journal of Emerging Technology in Computer Science & Electronics (IJETCSE)

ISSN: 0976-1353 Volume 14 Issue 2 APRIL 2015.

To calculate the value of C, C=Me(mod M)

where M is the pixel to be encoded and C is
the cipher pixel.
To calculate the value of M, M=Cd (mod N)
where M is the decrypted original pixel.

Journal of Computer Science and Information

Technologies,Vol.5(1),2014,184-191.
5.
The
paper
J.Rethna
Virgil
Jeny,
ChandaJagadishjangid, Enhancing Security of Multi
Biometric Cryptosystem using RSA, International
Journal for Advance Research in Engineering and
Technology, Vol 1, Issue 2, March 2013.
6. Shital B. Patil and Uma Nagaraja, Preservation of
Biometric Data Using Visual Cryptography, Computer
Technology & Applications, Vol 5,Issue No 3, 2014
7.
The paper AntikaGharat, PreetiTambre, Yogini
Thakare and S.M.Sangave, Biometric Privacy using
Visual Cryptography, International Journal of
Advanced Research in Computer Engineering &
Technology, Vol 2, Issue 1, January 2013.
8. Manish Manorial, Ajit Kumar Shrivastava, Satyandra
Singh Thakur, DebuSinha, Exploring the Prospect of
Secure Biometric Cryptosystem using RSA for Blind
Authentication, International Journal of Wisdom
Based Computing, Vol. 1, No 2, August 2011.
9. Manika Sharma and RekhaSaraswat, Secure Visual
Cryptography Technique for Color Images Using RSA
Algorithm, International Journal of Engineering and
Innovative Technology (IJEIT), Vol 2, Issue 10, April
2013.
10.Nikos Komninos and TassosDimitriou, Protecting
Biometric Templates with Image Watermarking
Techniques, Athens Information Technology, GR19002 PeaniaAttiki, Greece.

Figure 2- Public key cryptography

The above fig 3 shows the public key
cryptography, here public key is used for
encryption and private key is used for
decryption.
VIII.

CONCLUSION
Thus we have studied we give biometric
privacy using visual cryptography. We provide
the security to the biometric data to protect the
privacy of a image database by decomposing an
input private into two independent sheet images
such that the private image can be reconstructed
only when both sheets are simultaneously
available.This paper presents cryptography
system with RSA algorithm to secure biometric
template from different attacks. For RSA
encryption we use public key and decryption we
use private key.Here we are combining both
visual cryptography and RSA algorithm for more
secure for the Biometric Data.
REFERENCES
1. The paper Sanjukta Pal and Pranam Paul,
Cryptographic
Technique
using
Biometric
Authentication, International Journal of Innovative
Research
in
Computer
and
Communication
Engineering, Vol. 2, Issue 9, 2014.
2.Rahna. P. Muhammed, A Secured Approach to
Visual Cryptographic Biometric Template, Vol. 02,
No. 03, July 2011.
3.In pape rShubhangiRajanwar, ShirishKumbar and
AkshayJadhav, Visual Cryptography for Biometric
Privacy, International Journal of Science and
Research, Vol 3, Issue 12, Dec 2014.
4.M.Gobi and D.Kannan, A Secured Public Key
Cryptosystem for Biometric Encryption, International

212