Visual Cryptography: ARNOB BANIK (19BCE2488) VIJETA PRIYA (19BCB0077) Ranjan Kumar Goit (19bce2668)

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 19

VISUAL

CRYPTOGRAPHY
ARNOB BANIK(19BCE2488)
VIJETA PRIYA(19BCB0077)
RANJAN KUMAR GOIT(19BCE2668)
MODULAR DESIGN
Here, we finish
designing the project
including its detailed
01
architecture
INNOVATION
Here, we describe the
fundamental uses of 02 TABLE OF ADVANTAGES AND
DISADVANTAGES
Cryptography in the
modern world CONTENTS 04 Here, we mention the
important advantages
PROPOSED WORK
Here, we brief about the
fundamental work done
03 FOR and diadvantags

by the cryptographic
REVIEW 2 APPLICATION
system and the
technicality of visual
05 Here, we mention the
crucial applications of
visual cryptography
cryptography

IMPLEMENTATION

06 Here, we design the


codes for encryption
and decryption of the
message
01
MODULAR DESIGN
ARNOB BANIK (19BCE2488)
MODULAR DESIGN

1. Input Verification Module – We must first ensure that the input image(message) to be encrypted is of
a valid size, dimension, etc., before beginning the encryption process
2. Load Module- The input message/image is loaded in this module
3. Message Image Preparation - If the image was not of a suitable size, this module will process it as
resize it appropriately. before encryption
4. OTP Module - The secret image with one-time validity is generated by this module with random
pixelizations (onetime pad algorithm)
5. Mage Ciphering Module - The input image is ciphered by shuffling pixels, adjusting to the secret
image appropriately 11
6. Image Decryption Module- The main function integration with PIL is carried out here to use the
secret image to decipher the message/image that has been encrypted.
CRYPTO QUOTE
If you reveal your secrets to the wind, you should
not blame the wind for revealing them to the trees.
-
Kahlil Gibran
INNOVATION
02
ARNOB BANIK (19BCE2488)
INNOVATION

Innovative Ideas
• Contrast improvement
• Share size improvement
• pixel expansion
• Ability of sharing single/ multiple secret images
• Efficiency
• Security
• In order to improve the quality of decrypted images, inverse
• half toning can be applied.
PROPOSED WORK
03
VIJETA PRIYA (19BCB0077)
PROPOSED WORK
In certain cases, even with incredible developments in computer technology, using a computer to decode
hidden images is difficult. In these cases, one of the most convenient and effective methods for hidden
recovery is the human visual system. Moni Naor and Adi Shamir pioneered Visual Cryptography in 1994.

They come up with a visual hidden sharing scheme where an image is split or divided into n shares such that
the image can only be decrypted by someone with all n shares, thus no information about the original image
can be revealed by someone with any n-1 shares. Each share is printed on a separate transparency (which
serves the secret key purpose) and decryption is done by overlaying the shares when the original image is
seen when all n shares are overlaid.
PROPOSED WORK
Visual Cryptographic is one of the new techniques which provide information security and uses the simple
algorithm unlike the complex one used in other traditional cryptography. This allows visual information like
pictures to be encrypted in such a way that their decryption can be performed by human visual system
without any complex computation or algorithms. This is known as (k, n) VCS model where k represents
minimum no of shares needed to decrypt the secret image and n is the total number of shares generated by
the visual cryptographic scheme.

Hence, the whole Visual cryptographic process can be summarized as:


• Plaintext (in the form of image)
• Encryption (creating shares)
• Channel (Fax, E-mail)
• Decryption (Human Visual System)
04
ADVANTAGES AND
DISADVANTAGES
VIJETA PRIYA (19BCB0077)
RANJAN KUMAR GOIT(19BCE2668)
ADVANTAGES

1. Simple to implement Decryption algorithm not required (Use a human Visual System). So a person
unknown to cryptography can decrypt the message. We can send cipher text through FAX or E-MAIL.
Lower computational cost since the secret message is recognized only by human eyes and not
cryptographically computed.
2. Simple to incorporate. (Use a human visual system) No decryption algorithm needed. So the message
can be decrypted by a person unknown to cryptography. We can send encrypted text via FAX or E-MAIL.
Lower computational cost because only human eyes are known and not cryptographically calculated for
the hidden message.
DISADVANTAGES

1. The contrast of the reconstructed image is not maintained.


2. Perfect alignment of the transparencies is troublesome.
3. Due to pixel expansion the width of the decoded image is twice as that of the original image. Leads to
loss of information due to change in aspect ratio.
4. The desired receiver now observes the deciphered image(darker) by combining the ciphered and one-
time valid secret image. Using one-time-pad algorithm forbids reuse of the secret image, this one-time
validity helps make the cryptography impenetrable and safe from attackers.
5. Additional processing is required for colored images. The first two main tasks are as follows:
o An image to be to be kept as a secret is taken to produce a ciphered image which will look
completely random.
o A secret image (also random) which can be combined appropriately with the ciphered image is
produced. This should be allowed to use only once so as to prevent easy deciphering.
APPLICATION
05
RANJAN KUMAR GOIT(19BCE2668)
APPLICATION

• Biometric security
• Watermarking
• Steganography
• Remote electronic voting
• Bank customer identification
– Bank sends customer a set of keys in advance
– Bank web site displays cipher
– Customer applies overlay, reads transaction key
– Customer enters transaction key
06
IMPLEMENTATION
ARNOB BANIK (19BCE2488)
IMPLEMENTATION
The general algorithms used were:
• Input Image Verification Algorithm Image (Message) Encryptions Algorithm
• Ciphered and Key Image Alignment (Decryption)
But a unique algorithm was in use too and it is called
• One-time-pad Algorithm
In this cryptography method, a key of the same size or longer than the message to be encrypted, with onetime
validity, is pre shared. This key is called a One-time-pad. The message to be encrypted is paired with a random
secret key that is used in combination to encrypt the message by combining it using modular addition. While
usually the message to be encrypted is a plaintext, we aim to carry out a visual implementation of this
algorithm. It is the one of the few crypto algorithms that has been proven to be completely unbreakable.

One of the main advantages that One-time-pad algorithm provides is that we don't need a computer to decipher
the messages we receive (but we do need one to generate the ciphered messages). For advanced security
purposes, we would first generate many random secret images and share them securely with the person you
want to communicate with, then later we must use one different secret image for each message we want to
send - never reusing a secret image.
IMPLEMENTATION
TOOLS
Encryption:
• IDLE (Integrated Development Environment for Python)
• Python 3.4
• Python Image Library (PIL)
• Pillow (PIL fork) 5.1.0
Decryption:
• Transparent sheets for demo
LET’S GO FOR THE
IMPLEMENTATION
!
Questions are welcome!

Information Security Analysis and Audit


Prof. Rajarajan G
Vellore Institute of Technology

CREDITS: This presentation template was created by Slidesgo,


including icons by Flaticon, and infographics & images by Freepik.
Please keep this slide for attribution.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy