ARMY DATA ENCODE USING VISUAL CRYPTOGRAPHY A Project report submitted in partial fulfillment of the requirements for the award of the degree of BACHELOR OF TECHNOLOGY IN COMPUTER SCIENCE ENGINEERING Submitted by M.V.R. NIKHIL 316126510029 B. NIKHIL 316126510006 K. SAI SANKAR 316126510023 SHIV SHANKAR SINGH 316126510050 D. SAI GANESH PATNAIK 316126510071 Under esteemed guidance of Mr. G. Jagadish Assistant Professor Dept. of CSE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING ANIL NEERUKONDA INSTITUTE OF TECHNOLOGY & SCIENCES (AUTONOMOUS) (Permanently Affiliated to Andhra University) SANGIVALASA: VISAKHAPATNAM – 531162 2019-2020 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING ANIL NEERUKONDA INSTITUTE OF TECHNOLOGY AND SCIENCES (UGC AUTONOMOUS) (Affiliated to AU, Approved by AICTE and Accredited by NBA & NAAC with ‘A’ Grade) Sangivalasa, Bheemili Mandal, Visakhapatnam dist.(A.P) CERTIFICATE This is to certify that the project report entitled “ARMY DATA ENCODE USING VISUAL CRYPTOGRAPHY” submitted by M.V.R. Nikhil(316126510029), B. Nikhil (316126510006), K. Sai Sankar(316126510023), Shiv Shankar Singh(316126510050), D. Sai Ganesh Patnaik(316126510071) in partial fulfilment of the requirements for the award of the degree of Bachelor of Technology in Computer Science Engineering of Anil Neerukonda Institute of technology and sciences (A), Visakhapatnam is a record of bonafide work carried out under my guidance and supervision. Project Guide Head of the Department Mr. G. Jagadish, Dr. R. Sivaranjani, Assistant Professor Professor Department of CSE Department of CSE ANITS ANITS DECLARATION We, M.V.R. NIKHIL, B. NIKHIL, K. SAI SANKAR, SHIV SHANKAR SINGH, D. SAI GANESH PATNAIK of final semester B.Tech., in the department of Computer Science and Engineering from ANITS, Visakhapatnam, hereby declare that the project work entitled ARMY DATA ENCODE USING VISUAL CRYPTOGRAPHY is carried out by us and submitted in partial fulfillment of the requirements for the award of Bachelor of Technology in Computer Science Engineering , under Anil Neerukonda Institute of Technology & Sciences(A) during the academic year 2016-2020 and has not been submitted to any other university for the award of any kind of degree. M.V.R.NIKHIL 316126510029 B.NIKHIL 316126510006 K.SAI SANKAR 316126510023 SHIV SHANKAR SINGH 316126510050 D.SAI GANESH PATNAIK 316126510071 ACKNOWLEDGEMENT We would like to express our deep gratitude to our project guide Mr. G. Jagadish, Assistant Professor, Department of Computer Science and Engineering, ANITS, for his guidance with unsurpassed knowledge and immense encouragement. We are grateful to Dr. R. Sivaranjani, Head of the Department, Computer Science and Engineering, for providing us with the required facilities for the completion of the project work. We are very much thankful to the Principal and Management, ANITS, Sangivalasa, for their encouragement and cooperation to carry out this work. We express our thanks to all the teaching faculty of Department of CSE, whose suggestions during reviews helped us in accomplishment of our project. We would like to thank all non-teaching staff of the Department of CSE, ANITS for providing great assistance in accomplishment of our project. We also thank our project coordinator Dr. K. Suresh, Assistant Professor, Department of Computer Science and Engineering, ANITS, for his constant support throughout our project period. We would like to thank our parents, friends, and classmates for their encouragement throughout our project period. At last but not the least, we thank everyone for supporting us directly or indirectly in completing this project successfully. PROJECT STUDENTS M.V.R. NIKHIL (316126510029) B. NIKHIL (316126510006) K.SAI SANKAR (316126510023) SHIV SHANKAR SINGH (316126510050) D.SAI GANESH PATNAIK (316126510071) ABSTRACT In any army a decision is not directly taken by just one commander or leader but rather that same decision is taken only after discussing about that issue and a majority agrees upon it. This had become the base idea of our project. In this project, the idea was to secretly transmit a secret image which can possible be any kind of important map or as such to the main people in the army and the original image can be formed only when the required number of people agree to that plan. This is done by the concept called “Visual Cryptography”. Visual Cryptography deals with images. Visual cryptography is a technique which allows visual information such as images, videos etc. to be encrypted in such a way that the decrypted information appears as a visual image .In this project we implement visual cryptography on black and white images and color images(RGB) using “(k , n) secret image sharing algorithm” .This scheme is perfectly secure and very easy to implement. We extend this algorithm in such a way that the secret image is divided into n shares and each share is sent to n different officers and only when at least k officers (k ≤ n) agree to see the secret and when they combine their individual share, the secret is revealed. Keywords cryptography, decryption, encryption, k out of n shares, (k, n) secret sharing algorithm, OR, RSA, shares, visual cryptography. i TABLE OF CONTENTS ABSTRACT i List of Figures v List of Tables vii 1. INTRODUCTION 1 1.1 Digital Image Processing 1 1.1.1 Steps in Image Processing 1 1.1.2 What is an Image? 1 1.1.3 Representation of an image in a Matrix 2 1.1.4 Types of Images 2 1.2 Visual Cryptography 3 1.2.1 Cryptography 3 1.2.2 Visual Cryptography 3 1.3 Motivation for the work 4 1.4 Problem Statement 6 2. LITERATURE SURVEY 7 2.1 Binary Image 8 2.2 Quantization and Thresholding 10 2.3 Halftoning 11 2.4 Dithering 13 2.5 Human Visual System 15 ii 2.6 Shamir’s Secret Sharing Scheme 16 2.7 Secret Sharing Scheme Using Lagrange’s Interpolation Theorem 16 2.8 Two-out-of-two Secret Sharing Scheme 17 2.9 K-N Secret Sharing Scheme 19 2.10 Existing System 20 3.METHODOLOGY 22 3.1 Proposed System 23 3.1.1 System Architecture 23 3.1.2 Modules 25 3.1.2.1 Encryption 25 3.1.2.2 Division Into ‘n’ Shares 28 3.1.2.3 Generate and Send e-mails to each Shareholder 31 3.1.2.4 Overlapping ‘k’ Shares 31 3.1.2.5 Decryption 34 4.EXPERIMENTAL ANALYSIS AND RESULTS 37 4.1. System Configurations 37 4.1.1 Software Configurations 37 4.1.2 Hardware Configurations 37 4.2 Sample Code 38 4.3 Screenshots and Outputs 49 4.4 Experimental Analysis 59 iii 5.CONCLUSION AND FUTURE WORKS 62 5.1 Conclusion 62 5.2 Future Works 62 REFERENCES 64 APPENDIX 65 iv LIST OF FIGURES FIGURE FIGURE DESCRIPTION PAGE NO. NO. Fig(2.a) Bitmap Representation 9 Fig(2.b) Quantization levels for 8-bit representation of an Image 10 Fig(2.c) Original Image and its Threshold Image 11 Fig(2.d) Original Halftone Image v/s how a Human Eye sees a Halftoned 12 Image Fig(2.e) Original Image and Halftoned Image 13 Fig(2.f) Original Image, Image with Uniform Quantization and Dithering 14 Fig(2.g) Human Visual System as OR function 15 Fig(2.h) Construction of a two-out-of-two VC scheme: a secret pixel can be 18 encoded into two subpixels in each of the two shares. Fig(2.i) An example of two-out-of-two VC scheme. 19 Fig(3.a) System Architecture 23 Fig(3.b) Encryption and Division into ‘n’ shares 28 Fig(3.c) Merging at least ‘k’ shares and Decryption 33 Fig(3.d) Order of Encryption and Decryption 34 Fig(4.a) Home Page 49 Fig(4.b) Encryption and Dividing into ‘n’ Shares Page 50 Fig(4.c) Page after encryption and dividing into ‘n’ shares: also shows 50 which share is sent to which e-mail address. Fig(4.d) Merging ‘k’ Shares and Decryption Page 51 Fig(4.e) Output Page (when there are at least required number of ‘k’ shares 51 and keys of both RSA and Caesar Cipher are correct). Fig(4.f) Output Page (when there are at least required number of ‘k’ shares 52 and key RSA is wrong and key of Caesar Cipher is correct). Fig(4.g) Output Page (when there are at least required number of ‘k’ shares 52 and key RSA is correct and key of Caesar Cipher is wrong). Fig(4.h) Output Page (when there are less than required number of ‘k’ shares 53 and keys of both RSA and Caesar Cipher are correct or wrong). Fig(4.i) Data Set that is worked on 53 Fig(4.j) Original Input Image 54 Fig(4.k) Encrypted Image(key in CC: god 54 Key in RSA: p=89,q=97,e=5,d=5069,n=8633) Fig(4.l) ‘n’ Shares of the Input Image 55 (n=5, k=4) Fig(4.m) Image obtained after merging at least ‘k’ shares (here 4 shares are 56 taken) Fig(4.n) Image obtained after merging less than ‘k’ shares (here 3 shares are 56 taken) and before decrypting v Fig(4.o) Output Image obtained when both the keys are correct 57 Fig(4.p) Output Image obtained when only the decryption key used in 57 Caesar Cipher is Wrong Fig(4.q) Output Image obtained when only the decryption key used in RSA 58 is Wrong. Fig(4.r) Output Image obtained when less than ‘k’ shares are combined. 58 Fig(app1) Structure of Django 67 vi LIST OF TABLES TABLE TABLE DECRIPTION PAGE NO. NO. Table 4.a RSA Encryption and Decryption times for images with different 59 resolutions Table 4.b Caesar Cipher Encryption and Decryption times for images with 60 different resolutions.