Documente Academic
Documente Profesional
Documente Cultură
www.ijtsrd.com
due to its linear nature, the basic Hill cipher succumbs where P is plain text and C is cipher text.
to known-plaintext attacks. Indeed, it is easy to show
69
IJTSRD | May-Jun 2017
Available Online @www.ijtsrd.com
International Journal of Trend in Scientific Research and Development, Volume 1(4), ISSN: 2456-6470
www.ijtsrd.com
4.1. Generating lower and upper triangle matrices 1 0 0
using LU decomposition method WhereL= 1 0 and
Theorem: Every m-square matrix A can be expressed 1
as product of two triangular matrices, one lower 0
triangular and another upper triangular thus A=LU, U=
where q is prime number and A 0 0
= , =
= =
0 0
0 = + =
Where L= and
Example 4.1.1
0
U= 4 1
0 0 ConsiderA=
2 3
4 1
A= can be decomposed into L and
2 3
To simplify calculations we may choose 4 2 1 0
U.A=LU = 0
( , ,.. )= 6 3 1
(1,1, . . ,1) ( )
4 1
= + , = 4, =
2 3
1, =2 =
=
+ =3 =
1 0 0
1 0 0
1 0 1 0 4 1 4 1
0 0 L= = 1 mod 29, U= = 0
1 15 1 0 17
mod 29, Therefore L, U
70
IJTSRD | May-Jun 2017
Available Online @www.ijtsrd.com
International Journal of Trend in Scientific Research and Development, Volume 1(4), ISSN: 2456-6470
www.ijtsrd.com
=
1 0 0
=
1 0 0
1 0 0
(
Multiplying the matrices L and U and equating
corresponding elements from both sides mod q)
4.3. Encryption
u11=all, u12=a12, u13=a13. Let C be a block of cipher text and B is constant
l21u11=a21 l21= matrix then encryption can be defined as AC=B and
LC=B C=L-1B
l31u11=a31l31=
l21u21+u22=a22u22=a22-( )
l21u13+u23=a23u23= ( ) C= be a block of cipher
( )
l31u13+l32u22=a32 l32= text
( )
l31u13+l33u23=a33u33= -
( )
1 0 0
( )
( ) 1 0
1
4.2. Calculation of constant matrix
=
Let P is block of given plain text. In that block P
assigns labels fromtable -1according to given plain
text. Let be constant matrix and A is generator key
matrix then B=AP mod q, where q is prime number.
=
1 0
A= is matrix of order m, 0
1 0
1
P= and
4.3.1. Encryption algorithm
B=
Step1: Calculate B=AC (mod q)
71
IJTSRD | May-Jun 2017
Available Online @www.ijtsrd.com
International Journal of Trend in Scientific Research and Development, Volume 1(4), ISSN: 2456-6470
www.ijtsrd.com
Step2: Select Key L as square matrix order m from 4 1
A= can be decomposed into L and
A=LU. 2 3
4 1 1 0 4 1
U.A=LU =
Step3: Calculate C=L-1B 2 3 15 1 0 17
4 1 6 14 11
Let P be a block of plain text and C be a block of B= (mod 29)
2 3 14 6 4
cipher text thenUP=C P=U-1C
9 4 19
B= (mod 29)
25 17 5
0
Let C= be a block of cipher text.
0 0
1 0
Encryption key L=
15 1
=
LC=B C=L-1B mod 29
=
1 0 9 4 19
0 C= ( mod 29)
15 1 25 17 5
0 0
9 4 19
C= =
4.4.1. Decryption algorithm 14 15 10
72
IJTSRD | May-Jun 2017
Available Online @www.ijtsrd.com
International Journal of Trend in Scientific Research and Development, Volume 1(4), ISSN: 2456-6470
www.ijtsrd.com
6. Cryptanalysis of proposed technique Conclusion
The block cipher can be difficult to break with a In the proposed work the symmetric key matrix of
cipher text only attack. In this section, we discuss classical Hill cipher is to make changes in order to
Cryptanalysis of known plain-text attack. We make greatest security of communication text. In this
assumed that K is key matrix is an element of paper symmetric key generation is more secure due to
the decomposition of the matrix into lower and upper
triangle matrices to encrypt and decrypt the messages
.The Proposed Cryptosystem to get better the plaintext
6.1.Algorithm for known plain-text attack when m
attack and also to get better cipher text attack, since
is known
the lower triangle matrix is using for encryption
Step1: Let P= (P1,P2,,Pn) be a block of plain text. process and upper triangle matrix is using for
decryption process over residue modulo prime
Where Pi= Let C= (C1,C2,,Cn) be a number
References
block of cipher text. Where
[1] Douglas R. Stinson,Cryptography Theory and
Ci= and select randomly pairs of plaintext and practice ,third edition (2006)by chapman & Hall/CRC
Taylor &Francis Group.
corresponding cipher text are
[2] Koblitz, N. A Course in Number Theory and
(Pi,Ci)for i=1,2,3.n.
Cryptography, 2nd ed. New York: Springer-Verlag,
Step2: The known plaintext cipher text pairs 1994.
gives us a system of equations of the form
[3]A. Menezes, P. van Oorschot, and S. Vanstone,
[Ci- Cj]=K[Pi- Pj] for 1 ijm , we Handbook of Applied Cryptography, CRC Press,
get general equation C=KP 1996
Step 3: Determine K=P-1C mod q
[4]G.R. Blakley, Twenty years of cryptography in the
6.2. Example for cryptanalysis of proposed open literature, Security and Privacy 1999
technique when m=2 is known Proceedings of the IEEE Symposium, 9-12 May1999
73
IJTSRD | May-Jun 2017
Available Online @www.ijtsrd.com
International Journal of Trend in Scientific Research and Development, Volume 1(4), ISSN: 2456-6470
www.ijtsrd.com
[8]P.B. Bhattachary SK Jain S.R. Nagpaul First
course in Linear Algebra 1983
[9] W. H.; Flannery, B. P.; Teukolsky, S. A.; and
Vetterling, W. T. "LU Decomposition and Its
Applications." 2.3 in Numerical Recipes in
FORTRAN: The Art of Scientific Computing, 2nd ed.
Cambridge, England: Cambridge University Press, pp.
34-42, 1992.
74
IJTSRD | May-Jun 2017
Available Online @www.ijtsrd.com