International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org

Volume 3, Issue 5, September-October 2014

ISSN 2278-6856

MULTIPLE TEXT CRYPTANALYSIS BY

USING MATRIX AND LOGICAL
OPERATIONS
1

Dr. S. Kiran , R.Pradeep Kumar Reddy2 , I.Raja Sekhar Reddy3

1,2

Assistant Professor
Y.S.R Engineering college of Y.V.U
3
3rd B.Tech C.S.E
Y.S.R Engineering college of Y.V.U

Abstract
Data Security is plays a vital role in Data Communication
through Internet . Definitely there is a need to protect the data
from unauthorized access .To protect data Cryptography plays
an important role . Cryptography is a technique which allow
human-being to encrypt the data in such a way that the
decryption can be performed without the aid of sender. In
proposed algorithm logical OR operation is used to generate
key , XOR operation is used to encrypt data which is a
reversible process . By using Railfence algorihm data will be
shuffled . In this algorithm key will be changed from round to
round . This algorithm is more secure because it uses different
key for each round.Logical OR , XOR operations are very easy
to implement so that this can be implemented eassly .

1. 1.Introduction
Now-a-days wireless communication is used more
commonly than wired. During communication information
is transmitted/received from one system to other system or
between networks. While transferring the information[1]
the major thing to be concerned is to provide security[1] to
the information to avoid from the attack of intruders. The
security not only considers the adequate protection but also
should focus on external environment. The external
environment includes both the potential and rogue users.
Based on IP address data transmission is done. Through
the falsified address intruders may grab the data.
Information security consists of following factors
integrity[5], confidentiality[3], authentication[2] and nonrepudiation[4].
Authentication: The process of proving one's identity.
Privacy/Confidentiality: Ensuring that no one can
read the message except the intended receiver.
Integrity: Assuring the receiver that he received
message has not been altered in any way from the
original.
Non-repudiation: A mechanism to prove that the
sender really sent his message
Cryptography[4] is the tool used to provide security.
Modern cryptography is based on key.

2. Existing method
2.1Encryption algorithm:
Step 1: Start
Step 2: Input the plaintext message Pi, 1 i n.
Step 3: Declare the key value K.
Step 4: Generate 5 different key values Kj, 1 jmod6,
K1= K, K2 = 2*K, K3 = 3*K,

Volume 3, Issue 5, September-October 2014

K4 = 4*K, K5 = 5*K;
Step 5: Ci = Pi + Kj;
Step 6: Repeat for i = 1 to n
j = 1 to mod 6
Ci = Pi + Kj;
= Left shift (Ci);
[Ci] final = Ones Complement of [
Output [Ci] final
Step 7: Stop
2.2Decryption algorithm
Completely reverse process of encryption algorithm.

];

3.Proposed method
3.1 Encryption process:
The message is in the form of plain text. It is represented
in matrix form and mathematical and logical operations on
matrices will act as key. XOR operation is performed for
original and key matrix. The result is arranged by using
rail-fence algorithm and it is cipher text.
3.1.1 Encryption algorithm
Step1: start
Step2: Input message is transmitted
Step3: Take character by character in plain text and
arrange them in matrix form
Step4: perform mathematical or logical operations
Step5: The result of the step4 act as key
Step6: perform XOR operation for original matrix and
key matrix
Step7: Rail fence algorithm is applied for resultant
matrix
Step8: The result of step7 is cipher text
Step9: stop
3.2 Decryption process
Cipher text is arranged in the matrix form using rail fence
algorithm. XOR operation is performed for each matrix
with key matrix which is used as encryption process. The
result of the XOR operation is in text form that is plain
text.
3.2.1 Decryption algorithm
Step1: start
Step2: cipher text is given as input
Step3: Arrange the cipher text in matrix form by
applying rail fence algorithm
Step4: Perform XOR operation on each matrix with key
matrix
Step5: Arrange character by character from resultant
matrix

Page 44

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 5, September-October 2014
Step6: The result of step5 is plain text
Step7: stop
4.Description of algorithm
4.1 Encryption
Consider the following message which is to be
transmited
from
sender
to
receiver
A1,A2,.,A9,B1,B2,,B9,.. .
Consider first 9 characters as one matrix(3x3) called
A and next 9 characters as another matrix(3x3) called
B.
Represent each character with their ASCII value in
both the matrices .
Perform logical OR operation on these two matrices .It
generates key matrix K1,K2,..,K9 called as K(3x3) .
Now perform XOR operation on matrices A , K and B
, K . It produces the matrix KA1,KA2,.,KA9 called
as KA(3x3) and KB1,KB2,.,KB9 called as KB(3x3)
.Arrange the matrices KA and KB in linear form .
Now apply Railfence algorithm on linear data of both
matrices
.Continue the above process till the end of message .
In next round the number of elements to form two
matrices is not sufficient then PADDING will be used.
The result of each round is concatenated from first
round to last round . The concatenated data is called
as Cipher text .
4.2 Decryption
Cosider Cipher text which is the output of encryption
process .
consider 18 elements from cipher text each time .
Apply reverse Railfence algorithm on it ,it generates
matrices
KA(KA1,,KA9)
and
KB(KB1,,KB9) .
Cosider the key matrix K(K1,,K9) which is used
for Encryption process.
Now perform XOR operation on matrices KA,K and
KB,K . It produces the matrices A(A1,.,A9) and
B(B1,..,B9) .
Represent each value in both matrices with their
equalent character .
Concatenate the characters of both matrices .
Continue the process till end of Cipher text .
The result of all rounds will be concatenated,that will
be the Plain text .

ISSN 2278-6856

Now consider the next 9 characters in the message

represent it in matrix(B) form

Represent each character in both matrices with their ASCII

values

Now perform OR operation on both matrices A and B , it

generates key matrix(K)

Now perform XOR on matrices A,K and B,K , it generates

KA and KB matrices

Now arrange it in linear form

KA=[001 007 004 000 073 018 000 004 004]
KB=[020 008 008 083 000 012 069 001 018]
Apply Railfence algorithm on KA and KB
[001 004 073 000 004 008 083 012 001 007 000 018 004
020 008 000 069 018]
Continue the process till end of message
Cipher text will be
[001,004,073,000,004,008,083,012,001,007,000,018,004,0
20,008,000,069,018,..].
5.2 Decryption
Consider Cipher text
[001,020,007,008,004,008,000,083,073,000,018,012,000,0
69,004,001,004,018,..].Now Consider 18 elements
from Cipher text apply railfence . It generates KA and KB
in linear form.
KA=[001 007 004 000 073 018 000 004 004]
KB=[020 008 008 083 000 012 069 001 018]
Represent it in matrix(3x3) form .

5. Result
5.1 Encryption
Consider the message This message is very secret . Now
consider the first 9 characters from the message represent
it in matrix(A) form
A=
Represent each character in both matrices with their ASCII
values

Volume 3, Issue 5, September-October 2014

Page 45

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 5, September-October 2014

ISSN 2278-6856

Author

Represent each value in both matrices with character form

The plain text or original message will be

This message is ve

Features :

Multiple messages can be transmited at a time .

It involves simple coding .
More secure .
Low processing delay .
Simple and Strong .

6. Limitations
Size of both matrices must be equal.

7. Conclusion

Dr.S.Kiran is an Assistant Professor in the

department of Computer Science and Technology
at Yogivenama University, Kadapa, A.P. He has
completed his M.Sc and Ph.D in computer
science from S.K.University. He has acquired
M.Tech from Nagarjuna University. He has been
continuously imparting his knowledge to several students from
the last 5 years. He has published 11 National and International
public ations. His research interests are in the field of image
Processing, computer networks, data mining and data ware
house.

R.Pradeep Kumar Reddy received his

B.Tech. Degree in Computer Science and
Engineering from Bellary Engineering
College, Bellary (VTU ). M.Tech.
Degree in Computer Science and
Engineering at S.R.M University, Chenai. Currently He is
working as Assistant Professor in the Department of CSE
at YSR Engineering College of Yogivemana University,
Proddatur. He has got 9 years of teaching experience. He
has attended 5 workshops. He is a member of ISTE
Mr.I.RajaSekharReddy is a student in
the department of Computer Science and
Engineering at Y.S.R Engineering College
of Y.V.U . He is studying 4^th B.Tech .
His research interests are in the field of computer
networks&image processing.

Many algorithms and technologies have been proposed by

many research persons . But till facing problems to provide
security to the information which is being passed through
internet . The goal of this algorithm is to frustrate the
hackers and makes the cryptanalysis difficult .It is
symmetric key encryption . It uses different key for each
round , so that it is more secure .It is not only applicable
for 3x3 matrices but also applicable for any size of
matrices.In this paper single message is used for
encryption and decryption . We can use multiple messages
for encryption and decryption .

References
[1] Information Security: Text Encryption and Decryption
with Poly Substitution method and combining features
of cryptography.-R.Venkateswaram, Dr.V.Sundaram
,June 2010.
[2] A modified Hill cipher Involving Interweaving and
Iteration.- V. Umakanta Sastry, N. Ravi Shankar and
S. Durga Bhavani , July 2010.
[3] A block cipher having a key on one side of plain text
Matrix and its Inverse on the other side. Dr. V. U.
K.Sastry, Prof. D. S. R. Murthy, Dr. S. Durga Bhavani
.
[4] Cryptography and Network Security Principles and
Practices, Third Edition William Stallings
[5] Applied Cryptography Protocols, Algorithms and
Source Coding BRUE SCHNEIER, Second
Edition,John Wiley & Sons, Inc.

Volume 3, Issue 5, September-October 2014

Page 46