New Generation of Digital Academic-Transcripts using encrypted QR Code TM

Transcription

1 313 New Generation of Digital Academic-Transcripts using encrypted QR Code TM Use of encrypted QR Code TM in Mark-sheets (Academic Transcripts) Somdip Dey Department of Computer Science, St. Xavier s College [Autonomous], Kolkata, India. Mobile: somdipdey@ieee.org; somdipdey@acm.org Abstract Today, because of ever growing digital data, it is very important to optimize these data and preserve them in an eco-friendly manner. In this paper, the author presents a new method to digitize the academic transcript i.e. mark-sheets, and embed the digital format in the mark-sheet itself in the form of encrypted QR Code TM, so that the digital data can not be retrieved by any unauthorized user. In this way, we can save a lot of digital space, which was necessary to save those digital academic records of each student. In our new marksheet system, the digital data, which is embedded in the marksheet in form of encrypted QR code, can only be retrieved and decrypted using our own web-application, which is hosted in our website. Our new mark-sheet system introduces a new generation of digital academic transcripts, which is already under implementation in our St. Xavier s College [Autonomous], Kolkata, India, and till now the implementation results and success of the system have been remarkable. Keywords-result; mark-sheet; QR code; encryption; green computing; I. INTRODUCTION In the modern world, with the evolution of technology and un-ending growth in digital data, there is an essential need of optimization of online data and information present in the digital world. For example, every year millions of student graduate from different universities and colleges from different places in the world. It is not always possible to keep records and marks of all students in paper documents because it will consume a lot of papers, which in fact will harm the plant ecosystem and environment eventually, and for that reason digitization of those records are essential. But, digitization of data is costly too because as the digital data grow in size there is need of lager space and for that reason we need to add new servers and more space to hold those data and information. Keeping this problem in mind, the research group at St. Xavier s College [Autonomous], Kolkata, India, has introduced a new digital mark-sheet system. In our new mark-sheet system, we will be embedding the data digitally in form of QR Code [9][11], which is itself encrypted, so that the marks obtained by the student can not be tampered, and the data embedded in the mark-sheet can be only decrypted and read from our web-application deployed by St. Xavier s College s website. In this way, we do not have to increase our digital space or add new servers to our already existing system just because to save more marks record of students. QR Code TM [9][11][12] is a type of 2 dimensional matrix barcode, which gained popularity because of its large capacity to hold digital data and it can be integrated in any mobile devices. In our new mark-sheet system, we save the essential data of each student in the QR Code, like the student s name, roll number, registration number, semester and year of study, marks obtained in different subjects and grades secured. But, all the data saved and embedded in the QR Code, are encrypted, and then the QR Codes are printed in the mark-sheet of the student. So, in future if the student or any other person wants to see their marks digitally or wants to send their academic information to any University or Organization in digital format, then they can just scan the QR Code, decrypt the data and send the data. II. METHODS USED We use TTJSA encryption technique, which was designed by Nath et al. [1][2][3][4][5] and is an amalgamation of three different cryptographic modules: generalized modified Vernam cipher, MSA [2] and NJJSA [3], for the encryption purpose of data in the QR Code. After encrypting the data, we embed the data in the QR Code using a set of different protocol and ultimately generate the encrypted QR Code. We discuss the procedure in the following sections. A. TTJSA for Encryption Purpose of the Embedded Data TTJSA [1][4][5] is a combined symmetric key cryptographic method, which is formed of generalized modified Vernam cipher, MSA [2] and NJJSA [3] symmetric key cryptographic methods. The algorithm of the execution of TTJSA is as follows: 1) Algorithm of Generalized Modified Vernam Cipher with Feed-Back Mechanism: In this method, we have modified the normal Vernam Cipher [7][8] and made a more generalized version of it. In normal Vernam Cipher we apply XOR operation on the plain text with the key to get our final cipher text and use the vice-versa to get the decrypted out-put /13/$ IEEE

2 314 Formula for Vernam Cipher: Plaintext Key = Ciphertext (Encryption Process) Ciphertext Key = Plaintext (Decryption Process) But, in our method, instead of XOR operation we perform addition operation, i.e. we add the ASCII value of one byte of the plain text with the ASCII value of the corresponding byte of the key, and as an out-put or cipher text byte we generate the added value of plain text and key. But, if the value of the addition is greater than 255 then we send the remainder excessive value to the next byte of the plaintext and add it with it, i.e. if plain text + Key > 255, then {(plaintext + Key) 255} + next plaintext + Key. We call this method as feedback mechanism. Formula for our modified Vernam Cipher method: Plaintext + Key = Cipher Text, for Plaintext + Key < 256; Or else, {(plaintext + Key) 255} + next plaintext + Key = Cipher text But, we apply the aforementioned formula as block ciphers. First, we split the total plaintext file into blocks of bytes, where each block is less than or equal to 255. Then, we perform the aforementioned steps and in the last byte of each block, we send the residue value to the next block. This is the feedback mechanism, which is the unique feature of the whole method. Because of this property of the method, even if a single byte of data is changed in the original file, the output cipher text will be totally different. The method and execution of each step can be further known from the research-paper on TTJSA method [1]. 2) NJJSAA Algorithm: The encryption number (=secure) and randomization number (=times) is calculated according to the method mentioned in MSA algorithm [2]. Step 1: Read 32 bytes at a time from the input file. Step 2: Convert 32 bytes into 256 bits and store in some 1- dimensional array. Step 3: Choose the first bit from the bit stream and also the corresponding number(n) from the key matrix. Interchange the 1st bit and the n-th bit of the bit stream. Step 4: Repeat step-3 for 2nd bit, 3rd bit th bit of the bit stream Step 5: Perform right shift by one bit. Step 6: Perform bit(1) XOR bit(2), bit(3) XOR bit(4),...,bit(255) XOR bit(256) Step 7: Repeat Step 5 with 2 bit right, 3 bit right,...,n bit right shift followed by Step 6 after each completion of right bit shift. 3) MSA Encryption and Decryption Algorithm: Nath et al. [2] proposed a symmetric key method where they have used a random key generator for generating the initial key and that key is used for encrypting the given source file. MSA method is an upgraded module of Playfair cipher system [7]. MSA [2] method is basically a substitution method where we take 2 characters from any input file and then search the corresponding characters from the random key matrix and store the encrypted data in another file. MSA method provides us multiple encryptions and multiple decryptions. The key matrix (16x16) is formed from all characters (ASCII code 0 to 255) in a random order. The randomization of key matrix is done using the following function calls: Step-1: call Function cycling() Step-2: call Function upshift() Step-3: call Function downshift() Step-4: call Function leftshift() Step-5: call Function rightshift() How the above functions will work, have been discussed in detail by Nath et al[2]. The idea of these functions is to make elements in a square matrix in a random order so that no one can predict what will be the nearest neighbour of a particular element in that matrix. This method is basically modified Playfair method. In Playfair method one can only encrypt Alphabets but in MSA one can encrypt any character whose ASCII code from and one can apply multiple encryption here which is not possible in normal Playfair method. B. Generation of QR Code To create a QR code [9][11][10][13] is we first create a string of data bits. This string includes the characters of the original message (encrypted message in this case) that you are encoding, as well as some information bits that will tell a QR decoder what type of QR Code it is. After generating the aforementioned string of bits, we use it to generate the error correction code words for the QR Code. QR Codes use Reed-Solomon Error Correction technique [10]. Please note that in coding theory, Reed- Solomon codes (RS codes) are non-binary cyclic error correction codes invented by Irving S. Reed and Gustave Solomon. After the generation of bit-string and error correction code words, the resultant data is used to generate eight different QR Codes, each of which uses a different mask pattern. A mask pattern controls and changes the pixels to light or dark ones, according to a particular formula. The eight mask pattern formulas are defined in the QR Code specification, which is referred at the time of mask generation needed for the QR Code generation. Each of the eight QR codes is then given a penalty score that is based on rules defined in the QR specification. The purpose of this step is to make sure that the QR code doesn't contain patterns that might be difficult for a QR decoder to read, like large blocks of same-colored pixels, for example. After determining the best mask pattern, the QR Code, which uses the best mask pattern, is generated and shown as an output. If the size of the encrypted message becomes more than 1,264 characters then the characters appearing after

3 315 1,264 characters are used separately to generate another QR Code and the above mentioned process is repeated until and unless the total encrypted message is converted to QR Code(s). The method is discussed in details below: The Encrypted file, which is created using the method TTJSA is now treated as the input file and the string is extracted from the file to generate the QR Code. Step 1: call function file_read(output_file) Step 2: call function generateqrcode( str[] ) [9][10][11] [13] Step 3: call function delete_file(output_file) ALGORITHM FOR DECODEQRCODE() We here follow the reverse process of the above generateqrcode() Algorithm to detect the QR Code Image using Library Class and perform error correction using Reed-Solomon technique and get back the encrypted message. III. Fig 2: Decrypted Student s Information from QR Code We have also given a demonstration of our marks-sheet, which is under development process, in the following figure: RESULTS AND DISCUSSION We chose a student of anonymous name and produce the demonstration of the new mark-sheet system of that student g in the followingg figures. Fig 1: Student s Information in form of Encrypted QR Code Decryption of Dataa From QR Code Fig 3: An Actual Result (Mark-Sheet) having the Digital Data (Academic Record) in encrypted QR Code

4 316 Demonstration Test Case: Here, we demonstrate the new academic transcript system by proving a demo example, which was in its initial stages of development. code, and add more relevant and important information about the student in the digital format. We are also trying to implement more security and data assurance, so that the digital data can be saved and retrieved properly and securely. ACKNOWLEDGMENT Somdip Dey (SD) would like to thank his professors Dr. Asoke Nath and Shalabh Agarwal of Department of Computer Science, St. Xavier s College [Autonomous], Kolkata, India, for providing him the opportunity to be part of such a wonderful project. SD would also like to thank his fellow students for helping in the preparation of the project and for their enthusiasm. SD would also like to thank his parents, Sudip Dey and Soma Dey, for their un-ending faith and blessings. Data Embedded Digitally on the QR Code TM Fig 4: Demo of Initial Mark-sheet IV. CONCLUSION AND FUTURE SCOPE The mark-sheet system, presented in this paper, is very effective to save a lot of digital space, and the academic records, which are saved in the mark-sheets, can not be tampered because they are encrypted uniquely using our own custom built cipher method with uniquely generated key, which is very secure indeed. The research group at St. Xavier s College [Autonomous], Kolkata, India, is trying to further optimize the digital information, which is embedded in form of QR REFERENCES [1] Trisha Chatterjee, Tamodeep Das, Joyshree Nath, Shayan Dey, Asoke Nath, Symmetric key cryptosystem using combined cryptographic algorithms - Generalized modified Vernam Cipher method, MSA method and NJJSAA method: TTJSA algorithm, Proceedings of Information and Communication Technologies (WICT), 2011 held at Mumbai, 11 th 14 th Dec, 2011, pp [2] Asoke Nath, Saima Ghosh, Meheboob Alam Mallik, Symmetric Key Cryptography using Random Key generator, Proceedings of International conference on security and management(sam 10) held at Las Vegas, USA Jull 12-15, 2010, P-Vol-2, [3] Neeraj Khanna,Joel James,Joyshree Nath, Sayantan Chakraborty, Amlan Chakrabarti and Asoke Nath, New Symmetric key Cryptographic algorithm using combined bit manipulation and MSA encryption algorithm: NJJSAA symmetric key algorithm, Proceedings of IEEE CSNT-2011 held at SMVDU(Jammu) June 2011, Page (2011). [4] Somdip Dey,Joyshree Nath,Asoke Nath,"An Integrated Symmetric Key Cryptographic Method Amalgamation of TTJSA Algorithm, Advanced Caesar Cipher Algorithm, Bit Rotation and Reversal Method: SJA Algorithm", IJMECS, vol.4, no.5, pp.1-9, [5] Somdip Dey, Joyshree Nath and Asoke Nath. Article: An Advanced Combined Symmetric Key Cryptographic Method using Bit Manipulation, Bit Reversal, Modified Caesar Cipher (SD-REE), DJSA method, TTJSA method: SJA-I Algorithm. International Journal of Computer Applications 46(20): 46-53, May Published by Foundation of Computer Science, New York, USA. [6] Somdip Dey, SD-EQR: A New Technique To Use QR CodesTM in Cryptography, Proceedings of 1 st International Conference on Emerging Trends in Computer and Information Technology (ICETCIT 2012), Coimbatore, India, pp [7] Cryptography and Network Security, William Stallings, Prentice Hall of India. [8] Cryptography & Network Security, Behrouz A. Forouzan, Tata McGraw Hill Book Company. [9] "QR Code, Wikipedia", [Online] [Retrieved ] [10] Reed and G. Solomon, Polynomial codes over certain finite fields, Journal of the Society for Industrial and Applied Mathematics, 8(2): , [11] "ZXING- QR Code Library ", [Online] [Retrieved ] [12] N. Johnson and S. Jajodia, Steganaly- sis: The investigation of hidden information, Proc. Of the 1998 IEEE Information Technology Conference, [13] Somdip Dey, Kalyan Mondal, Joyshree Nath, Asoke Nath,"Advanced Steganography Algorithm Using Randomized Intermediate QR Host

5 317 Embedded With Any Encrypted Secret Message: ASA_QR Algorithm", IJMECS, vol.4, no.6, pp , [14] Somdip Dey, Joyshree Nath and Asoke Nath. Article: An Advanced Combined Symmetric Key Cryptographic Method using Bit Manipulation, Bit Reversal, Modified Caesar Cipher (SD-REE), DJSA method, TTJSA method: SJA-I Algorithm. International Journal of Computer Applications 46(20): 46-53, May Published by Foundation of Computer Science, New York, USA. [15] Somdip Dey, Amalgamation of Cyclic Bit Operation in SD-EI Image Encryption Method: An Advanced Version of SD-EI Method: SD-EI Ver-2, International Journal of Cyber-Security and Digital Forensics (IJCSDF) 1(3), pp [16] Somdip Dey, SD-EI: A Cryptographic Technique To Encrypt Images, Proceedings of The International Conference on Cyber Security, CyberWarfare and Digital Forensic (CyberSec 2012), held at Kuala Lumpur, Malaysia, 2012, pp [17] Somdip Dey, SD-AEI: An advanced encryption technique for images, 2012 IEEE Second International Conference on Digital Information Processing and Communications (ICDIPC), pp [18] Somdip Dey, SD-REE: A Cryptographic Method To Exclude Repetition From a Message, Proceedings of The International Conference on Informatics & Applications (ICIA 2012), Malaysia, pp [19] Somdip Dey, SD-AREE: A New Modified Caesar Cipher Cryptographic Method Along with Bit- Manipulation to Exclude Repetition from a Message to be Encrypted, Journal: Computing Research Repository - CoRR, vol. abs/ , [20] Somdip Dey, An Image Encryption Method: SD-Advanced Image Encryption Standard: SD-AIES, International Journal of Cyber- Security and Digital Forensics (IJCSDF) 1(2), pp [21] Somdip Dey, Asoke Nath, Modern Encryption Standard (MES) Version-I: An Advanced Cryptographic Method, Proceedings of IEEE 2 nd World Congress on Information and Communication Technologies (WICT- 2012), pp