A NOVEL ECRYPTION ALGORITHM TO ENHANCE DATABASE SECURITY
S Pratibha1, V Uma Rani2, Dr. K Suresh Babu3
1Computer Science, M.Tech,
School of Information Technology, JNTU Hyderabad
Hyderabad, Telangana, India
pratibha.s1893@gmail.com
2Asst. Professor,
School of Information Technology, JNTU Hyderabad
Hyderabad, Telangana, India
3Assoc. Professor,
School of Information Technology, JNTU Hyderabad
Hyderabad, Telangana, India
Abstract
Database is a composed gathering of information, numerous client needs to store their own and classified information’s in a database. Database security usually refers to the aggregate measures used to ensure and secure a database or database administration programming from illegitimate use and malicious threats and attacks. It is a wide term that incorporates a huge number of procedures, tools and techniques that guarantee security inside a database environment[9]. Cryptography is one commonly used technique to protect database from attacks and threats. In this paper we will discuss about a novel technique which uses reverse encryption and rotation encryption together to give advanced security to the database.
Keywords: encryption, REA, ROT13, database security.
1. INTRODUCTION
Database is a necessary piece of our everyday life and numerous database clients store their delicate information in their databases. At the point when contrasted with different ranges of PC security, Security to databases is sometimes not given much significance. Many Big databases were targeted as of late to get sensitive and confidential data from others database and most likely it will raise throughout the coming years[4]. So it is imperative to secure Database from unapproved client and different dangers[6]. This prompts the rise of database security. There are different Database security procedures accessible, few of them are Watermarking, Steganography and Encryption. Out of the different database security procedures Encryption strategy was turned out to be the more secured and simple procedure. In this paper we proposed a novel technique to protect database using two most commonly used techniques reverse encryption and rotation encryption.
2. RELATED WORK
2.1 DES
DES is a piece figure that uses shared secret key for encryption and decryption. DES calculation as explained by Davis R.[3] takes a fixed-length string of plain text bits and changes it through a series of operations into figure content piece string of a similar length. On account of DES, each piece size is 64 bits. DES too utilizes a key of 56 bits to modify the transformation, so that decryption can only be performed by the individuals who know the specific key used to encode the message. There are 16 similar phases of processing, termed rounds. There is additionally an initial and final permutation, named IP and FP, which are inverses (IP “fixes” the activity of FP, and vice versa). The Broad level steps in DES are as per the following:
1. In the initial step, the 64-bit plain text message is given over to the initial permutation (IP) work.
2. The IP is performed on the plain text.
3. The IP produces two parts of the permuted text; Left Plain Text (LPT) and Right Plain Text (RPT).
4. Now, each of LPT and RPT experience 16 rounds of encryption process.
5. In the final step, LPT and RPT are rejoined and a Final Permutation (FP) is performed on the combined block.
6. The result produces 64-bit cipher text
2.2 3DES
3DES (Triple DES) is an upgrade of DES[8]; it is 64-bit block size with 192 bits key size. In this standard the encryption technique is like the one in the original DES however applied 3 times to expand the encryption level what’s more, the average safe time as well[2]. 3DES is slower than other block figure strategies[9]. It uses either two or, on the other hand three 56 bit enters in the arrangement Encrypt-Decrypt-Encrypt (EDE).
2.3 REVERSE ENCRYPTION ALGORITHM
Reverse Encryption Algorithm is a symmetric stream cipher that can be adequately used for encryption of information[1]. It takes a variable-length key. The REA algorithm encryption and decryption comprises of the same operations, with the exception of the two operations:
1) Added the keys to the information in the encryption and evacuated the keys from the content in the decryption.
2) Executed divide operation on the content by 4 in the encryption and executed numerous operation on the content by 4 in the decryption.
We execute divide operation by 4 on the content to limit the range area of the ASCII code table at changing over the content.
2.3.1 Algorithm
1) Add the key before the information to be encrypted.
2) Convert the information to ASCII code and change that ASCII to binary format.
3) Reverse the binary formatted code and convert 8 bits binary code information to ASCII code.
4) Divide the converted ASCII format by 4, from divide operation put the Quotient as the first character and Remainder as the second character.
5) Return the cipher text.
2.4 ROTATION 13 ALGORITHM
Rotation 13 Algorithm is also known as ROT13 encryption. The ROT13 encryption is an exceptional instance of the Caesar figure, with a fixed key of 13[7]. ROT13 has been under large use for more than 30 years for email and usenet(network). ROT13 was for the most part helpful for encrypting messages. ROT13 depends on the rule that each letter in a reference letters corresponds to another letter in a rotated letter.
2.4.1 Algorithm
1) Read the character and the Rot value 13
2) Get the ASCII value of the character
3) If the ASCII value of the char Read is in the middle of (’65’ and ’90’) or (’97’ and ‘122 ‘) do step 4
4) Add previous ASCII value with ROT
5) If the total value is (>90)
6) Perform Subtraction of ROT with the ASCII value
7) Obtain the character for the Previous Result
8) Repeat step – 1 to 7 for all characters that are to be encrypted
9) Return the Encrypted content
3. PROPOSED WORK
The proposed Algorithm is the mix of REA and ROT13 encryption algorithm. As already said more rounds of encryption bring greater security. Rather than executing a similar algorithm the proposed approach joins two existing algorithms which turned out to be to be best in database security.
3.1 Proposed Algorithm
1. Input the data and key value
2. Concatenate the key to the secret data.
3. Convert the previous data to binary code.
4. With each 8 bits binary data divided into two parts and perform rotation operation by 3 places for both the parts.
5. Again gather 8 bits binary data from step 4 and convert it into decimal value.
6. Divide that decimal code by 4.
7. Obtain the ASCII code of the previous divide operation result and put the quotient as the 1st character and remainder as the 2nd character.
8. Return encrypted text.
3.2 Example of the proposed work
Secret Text- Welcome
Key- 123
1) Concatenate the key before the data: 123Welcome
2) Convert the concatenated data to ASCII code:
1 -> 49, 2 -> 50, 3 -> 51, W -> 87, e ->101, l ->108, c ->99, o ->111, m ->109, e->101
3) Convert that ASCII code to binary format:
00110001 00110010 00110011 01010111 01100101 01101100 01100011 01101111 01101101 01100101
4) Separate the each 8 bit binary data, divide into two equal halves, rotate it by 3 places and leave the 4th place as it is:
Eg: 0011 0001 1001 0001
10010001 10011000 10011001 00111011 10100011 10100110 10101001 10101111 10100111 10100011
5) Gather each 8 bits from the binary data and obtain the ASCII code:
145 152 153 59 163 166 169 175 167 163
6) Divide the previous ASCII code by 4 and obtain the ASCII of the result (put it as one ASCII character) and obtain the remainder (put it as second character):
145/4 = 36 -> $(ASCII of 36) and the remainder = 1(join ASCII of quotient and remainder $1).
152/4 = 38->&(ASCII of 38) and the remainder = 0 (join ASCII of quotient and remainder &0).
153/4 = 38 ->&(ASCII of 38) and the remainder = 1 (join ASCII of quotient and remainder &1).
59/4 = 14 ->SO(ASCII of 14) and the remainder = 3 (join ASCII of quotient and remainder SO3).
163/4 = 40 -> ((ASCII of 40) and the remainder = 3 (join ASCII of quotient and remainder (3 ).
166/4 = 41 ->) (ASCII of 41) and the remainder = 2 (join ASCII of quotient and remainder )2 ).
169/4 = 42 -> * (ASCII of 42) and the remainder = 1 (join ASCII of quotient and remainder *1 ).
175/4 = 43 -> + (ASCII of 43) and the remainder = 3 (join ASCII of quotient and remainder +3)
167/4 = 41 ->) (ASCII of 41) and the remainder = 3 (join ASCII of quotient and remainder)3).
163/4 = 40 -> ((ASCII of 40) and the remainder = 3 (join ASCII of quotient and remainder (3)
7) And the encrypted text is: $1&0&1SO3(3)2*1+3)3(3
3.3 Flow Chart of the proposed work
Fig.1 Flow Chart of the Proposed Work
4. CONCLUSION
The proposed algorithm increases the database security to a certain level and comparatively high than the two algorithms i.e. Reverse Encryption and Rotation 13 individually as the proposed algorithm combines these two algorithms. The Execution time of this proposed technique is comparatively high as this algorithm does two operations at a go.