VEL TECH MULTI TECH Dr.

RANGARAJAN
Dr. SAKUNTHALA ENGINEERING COLLEGE

DEPARTMENT OF INFORMATION
TECHNOLOGY

ENHANCED NETWORK SECURITY USING THREE LEVEL SECURITY

TEAM MEMBERS : PROJECT GUIDE :

1. V. ARAVINDAN – VM 10019 Dr. M.RAJESH KHANNA, M.TECH.,

Ph.D
2. G. SURIYA PRAKASH – VM 10009 ASST. PROFESSOR ,
IT - DEPT.
3. B. INDRAJITH – VM 10014
 ABSTRACT
 In today’s world, security is required to transmit confidential
information over the network and also demanded in wide range of
applications. Cryptographic algorithms play an important role in
providing the data security against malicious attacks.
 Rivest-Shamir-Adleman (RSA) algorithm is used however, several
attacks are introduced to break the security of these algorithms due
to certain constraints.
 In order to overcome the above said issue, “ENHANCED NETWORK
SECURITY USING THREE LEVEL SECURITY” is proposed to provide
more secured crypt analysis technique by enhancing the
randomness in the encryption process.
 The main objective of the project is to allow data transmission
between users using three level security with the help of advance
mechanism termed as “MRG” and provides a secured and
authorized network which secures their large amount of data
among themselves.
 LITERATURE SURVEY
 TITLE : A Research on Enhancing Public Key Cryptography
 AUTHOR : Alaa Hussein Al-Hamami and Ibrahem abdallah aldariseh,
(2013)“Enhanced Method of RSA cryptosystem Algorithm”,Kuala
Lampur,IEEE2013
 YEAR : 2013
 Description: This work prohibits any intruders from obtaining the plain
text in a readable form. The security aspect is enhanced as there is no
repetition of values in Magic rectangle. There are several parameters used
to increase the time complexity for the construction of magic rectangle
such as seed value, column sum, Minstart and Maxstart values. Even if the
intruders found the initial values of MR, it is very difficult to trace the
row/column. It plays a vital role in increasing the randomness and security
of the algorithm. And the use of RSA have the issue that the prime
numbers used should be more than 100. So have taken N-prime RSA so
that more than two prime numbers will be used and that can make the
prediction of prime numbers some what easier.
 And the other thing is that two same character in plain text do not have
same cipher text. One of the issues in the proposed work is additional
time needed for the construction of Magic rectangle initially.
 LITERATURE SURVEY (cont.,)
 TITLE : Add-on Security Level based on hybrid encryption algorithm
based on RSA algorithm and diffie hellman algorithm
 AUTHOR : Shilpi Gupta and Jaya Sharma

 YEAR : 2015

 Description: They proposed an algorithm by combining the two most

popular algorithm RSA algorithm and diffie hellman algorithm in order to
achieve higher security. RSA algorithm can be used for both public key
encryption and digital signature. Diffie hellman algorithm is used to
exchange the secret key between two parties and is also used for
providing more secure cipher text. RSA keys were taken as input to diffie
hellman algorithm. A GUI developed using java applet provides options to
the input user message and to upload file. Thus it provides the better
efficiency in terms of time complexity. A limitation of this paper is that the
key size of this algorithm is large
 EXISTING SYSTEM
• Maintaining a database for this problem also has lots of
problem with it.
• Two large prime numbers are used
• RSA Cryptosystem is used to generate keys
• Plaintext is encrypted with respect to ASCII values
• Cipher text is decrypted by RSA
• Repeated characters will have repeated ciphers

DRAWBACKS --

• Time taken to factorize n is less.

• It relies upon factoring problem only ,i.e single layer
security.
• Prime numbers should be carefully chosen such that they
are not relatively close and small.
 PROPOSED SYSTEM

• The methodology of the proposed security model is

described in the following steps. Construct different
singly even magic rectangle of order 32x48 and used
in lieu of ASCII table with 128 values. The Magic
rectangle contains totally 1536 values. It has been
divided into 12 quadrants, each consists of 128
characters.
• Each character of the plain text is converted into
numerals based on its position in magic rectangle in
different quadrants. The numerals are then
encrypted and decrypted using RSA algorithm.
DESIGN MODULES
 MODULE DESCRIPTION
 Generation of MRGA
• The column sum(32*48) , min start and max start is
obtained to compute MR .
 Mapping
• Input ASCII value are mapped with numerals in
quadrants.
 Encryption
• The mapped numeral is sent to 3-prime RSA to obtain cipher.
 Decryption
• The cipher is decrypted to get numerals.
 Searching
• The numerals are mapped with MR appropriately with
respect to quadrants to get plaintext.
 3 – PRIME RSA DESCRIPTION

• Choose three distinct prime numbers p, q and s.

• Find n such that n = p*q*s. n will be used as the modulus for

both the public and private keys.

• Find the Phi of n, ¥(n) = (p-1)(q-1)(s-1).

• Choose an e such that 1 < e < ¥ (n), and such that e and ¥ (n)
share no divisors other than 1 (e and ¥ (n) are relatively
prime). e is kept as the public key exponent.

• Determine d (using modular arithmetic) which satisfies the

congruence relation .d=e ^- 1 (mod ¥ (n)).
 ILLUSTRATION

• Inputs for MRGA

– Column_sum, min_start, max_start.

 MRGA DESCRIPTION

• Read the column sum for 32*48

• Obtain column sum for 4*6 from given 32*48 column sum.
• Column sum(4*6)=column sum(32*48) /16
• Row sum(4*6)=(column sum(4*6)/2)+column sum(4*6)
• Form a concrete structure for 4*6 magic rectangle generation
• Pivot=row sum(4*6)-column sum(4*6);
• Supply min start and max start for 64 units of 4*6 such that
sum of both gives pivot
• Combine 4 4*6 to form a 8*12
• Combine 4 8*12 to form a 16*24
• Combine 4 16*24 to form a 32*48
 FORMATION OF MAGIC RECTANGLE
FROM SQUARE

• The magic square concept forms the basis for magic

Rectangle.(order n*n)
• The sums of all the elements in every row, column are equal.
• 7 0 5 12
2 4 6 12
3 8 1 12
12 12 12 36
• The generation of magic rectangle is based on perfect
rectangle principle.
side lengths ratio=1:1.618
• In magic rectangle to increase randomness columns and rows
have different sum
SOLUTIONS
SOLUTIONS (Cont.,)
SOLUTIONS (Cont.,)
SOLUTIONS (Cont.,)
 REFERENCES

• Dr.D.I.George Amalarethinam , J.Sai Geetha (2014) ,

“Enhancing Security level for Public Key
Cryptosystem using MRGA”, World Congress On
Computing and Communication Technologies,IEEE,
vol 4 ,no 5 ,pp.98 – 102

• Hardik Gandhi,Vinit gupta,Rajput,(2015) , “A

Research on Enhancing Public Key Cryptography by
The Use of MRGA with RSA and N-Prime RSA”,
International Journal for Innovative Research in
Science & Technology, vol 1 , no 12 , pp.91 - 98