NETWORK SECURITY USING ARMSTRONG NUMBERS AND COLOURS
Aniket Hindlekar
1, Ketan Londhe
2, Prashant Lohar
3, Abdullah Shaikh
4, Mamta Ghalot
51, 2,3,4,5
Department of Information Technology, Atharva College of Engineering, Mumbai University, (India)
ABSTRACT
We are living in the information age. Hence data security plays an important role. Hackers are becoming more active nowadays. Hence it is increasingly becoming more important to protect our data. There are some techniques used to make data transmission with protection. Cryptography is one of them. This project provides a technique in which Armstrong number is used for encryptionof message. Colour is important in authentication process as it acts as password. Using this technique, message is hidden from unauthorized people and accessible to an authorized individual when required.
Keywords: Data Security, Armstrong Numbers, Authentication, Cryptography, Colour.
I. INTRODUCTION
In real world, data security is very important where importance is given to the confidentiality, authentication and integrity. Secure data transmission is really difficult because of the hackers. Cryptography is the universal technique for providing security to confidential data. The main goals of cryptography are access control and non- repudiation. It consists of encryption and decryption processes. Encryption and decryption have need of some secret information, usually referred to as a key. The same key might be used for both encryption and decryption depending on the encryption mechanism. While for other mechanisms, the keys used for encryption and decryption might be different.
RGB representation
Any color is the mixture of three colours RGB (Red, Green and Blue) in preset quantities. This is nothing but a RGB representation. Here values for Red, Green and Blue represent each pixel. So any color can be individually represented with the help of three dimensional RGB cube. RGB model uses 24 bits, 8 bits for each color. Hence colors are used as a password for authentication purpose. Then encryption or decryption process takes place [2]
or decryption process takes place [2]
Fig 1.1 RBG Colour Model
1.1 Cryptography
Cryptography is the art and study of hiding information i.e. technique to convert plain text into cipher text.
Cipher text is the message or data in unreadable format. Transformation of plain text into cipher text is done with the help of key it can be secret key or public key. This process is nothing but an encryption process.
Decryption is the reverse process of encryption in which cipher text is converted back into plain text (Original message) again with the help of key. [1]
Fig 1.2 Cryptographic Techniques
II. ALGORITHM
Types of Cryptographic Algorithms
There are several ways of classifying cryptographic algorithms. In general they are categorized based on the number of keys that are employed for encryption and decryption, and further defined by their application and use as in the three types of algorithms are depicted as follows
1) Secret Key Cryptography (SKC): Uses a single key for both encryption and decryption. The most common algorithms in use include Data Encryption Standard (DES), Advanced Encryption Standard (AES).
2) Public Key Cryptography (PKC): Uses one key for encryption and another for decryption. RSA (Rivest, Shamir, Adleman) algorithm is an example.
3) Hash Functions: Uses a mathematical transformation to irreversibly "encrypt" information. MD (Message Digest) algorithm is an example. [1]
Fig 2.1 Colour Code
III.PROPOSED SYSTEM FOR PROJECT
Fig 3.1 System Block Diagram IV. DETAILED DESCRIPTION OFMODULES
Armstrong numbers are used for encryption purpose while existing system uses prime number. Color is used for authentication purpose. Basic concept is that unique color is assigned to each receiver. This unique color acts as password. The sender knows required receiver to whom the data has to be sent. There can be N numbers of receivers who can access the encrypted data if they are authorized (N≤224). Firstly, encryption of color is done by adding key values to the original color values at sender’s side. This encrypted color acts as a password. Then data is encrypted using Armstrong numbers. At the receiver’s side when the receiver enters secret key, decryption of color takes place. The decrypted color is then matched with color assigned by sender i.e. original color stored at the sender’s database. Without the secret key, there is no way for user to access the data.
Further a combination, substitution and permutation methods are used with Armstrong number to ensure data security. S For encryption it converts each letter to its ASCII equivalent by substitution method and permutation is done with the help of Armstrong number. Later it convert that data into matrix form. It performs permutation process by using matrices. Receiver will perform in reverse manner. [2]
Fig 4.1: Data at Sender and Receiver Ends
4.1 Illustration
1) Encryption: As an illustration let us assume that the data has to be sent to a receiver (say A) who is assigned the color raspberry (135, 38, 87). Let the key values to be added with this color value be (-10, +5, +5). Let the Armstrong number used for data encryption be 153.
Step 1: (Creating password)
Initially the sender knows the required receiver to be A.
So the key values are added with the color values assigned for receiver A.
135 38 87 -10 5 5
--- 125 43 92
Now a newly encrypted color is designed for security check.
Step 2: (Encryption of the actual data begins here)
Let the message to be transmitted be “CRYPTOGRAPHY”.
First find the ASCII equivalent of the above characters.
C R Y P T O G R A P H Y
67 82 89 80 84 79 71 82 65 80 72 89
Step 3: Now add these numbers with the digits of the Armstrong number as follows
Step 4: Convert the above data into a matrix as follows
A=
Step 5: Consider an encoding matrix...
B=
Step 6: After multiplying the two matrices (B X A) we get C =
The encrypted data is...
779, 3071, 13427, 890, 3598, 16082, 1383, 6075, 28431, 742, 2834, 12190
The above values represent the encrypted form of the given message.
2) Decryption: Decryption involves the process of getting back the original data using decryption key. The data given by the receiver (the color) is matched with the data stored at the sender’s end. For this process the receiver must be aware of his own color being assigned and the key values.
Step 1: (Authenticating the receiver)
For the receiver A (as assumed) the actual color being assigned is Raspberry. (135, 38, 87), the key values (set of three values) are subtracted from the color being received to get back the original color.
The decryption is as follows.
The above set of values (135, 38, 87) is compared with the data stored at the sender’s side. Only when they both match the following steps could be performed to decrypt the original data.
Step 2: (Decryption of the original data begins here) The inverse of the encoding matrix is
D =
Step 3: Multiply the decoding matrix with the encrypted data (D X C) we get
Step 4: Now transform the above result as given below 68 87 92 81 109 88 72 207 92 81 77 92 Step 5: Subtract with the digits of the Armstrong numbers as follows
Step 6: Obtain the characters from the above ASCII equivalent
V. ADVANTAGES
The above technique involves keys with a minimum length of 8 bits for Armstrong numbers. This minimum key length reduces the efforts taken to encrypt the data. The key length can be increased if needed, with increase in character length. This increases the complexity thereby providing increased security. This technique ensures that the data transfer can be performed with protection since it involves two main steps. First step is to convert the characters into another form, by adding with the digits of the Armstrong numbers. Second step is to encode using a matrix to form the required encrypted data. Tracing process becomes difficult with this technique. This is because the Armstrong number is used differently in each step. The key can be hacked only if the entire steps involved in the encoding process is known earlier. This technique could be considered as a kind of triple DES algorithm since we use three different keys namely the colors, key values added with the colors and Armstrong numbers. Unless all the three key values along with the entire encryption and decryption technique is known the data cannot be obtained. So hacking becomes difficult mainly because of the usage of colors. Simple encryption and decryption techniques may just involve encoding and decoding the actual data. But in this proposed technique the password itself is encoded for providing more security to the access of original data.
VI. CONCLUSIONS
Thus we addressed the problem of security of secret message. Hence a technique is proposed in which Armstrong numbers are used instead of prime numbers to provide more security. The confidential areas like military, governments are targeted by the system where data security is given more importance. Colors, key values and Armstrong numbers which are three set of keys in this technique makes sure that there is secured message or data transmission and is available to authorized person
VII.ACKNOWLEDGEMENT
We are thankful to Prof. Mamta Ghalot for her guidance and support.
REFERENCES
[1] AtulKahate, “Cryptography and Network Security “, Tata McGraw [2] Hill Publications
[3] http://aix1.uottawa.ca/~jkhoury/cryptography.htm
[4] http://www.scribd.com/doc/29422982/Data-Compression-and-Encoding-Using-Col
