13 views

Uploaded by Anonymous 7VPPkWS8O

In this paper, the main cryptographic technique we will use affine cipher used for encryption and also
decryption by using one of the linear algebra technique lower and upper triangular tec…Full description

save

- 10916136 Malware Resilient Strong Authentication and Crypto Software as Service is Released
- A Review Based Study of Hybrid Security Schemes Based on Compression, Encryption and Steganography
- Image Encryption Using Advanced Hill Cipher Algorithm
- Computer Security Assignment
- RSA Introduction and Summary
- IS -Intro
- IJAIEM-2014-10-31-92
- Cryptography.doc
- tuitorial 2.txt
- e 124450
- Wikireader Cryptography
- IRJET-An Enhanced Encryption Technique using BCD and Bit Complementation
- rfid
- IRJET-Enhanced Cloud Data Security using Combined Encryption and Steganography
- Lecture 19
- NEM TechRef
- Ch1 - Overview
- AIS Chap 9.pdf
- icisc04
- CN_Labmanual
- Vital Investigation of Data in Hybrid Cloud
- A Critical Reassessment Of
- Hybrid Selective Steganography
- EEA &EIA
- chapter_0_welcome.pdf
- Permutation of Pixels within the Shares of Visual Cryptography using KBRP for Enhanced Security
- Dirceu InternetSecurity
- Palladium_Cryptography
- Ontology in Information Security 2001 Raskin
- CS50 Notes All Weeks
- Inland Surface Water Analysis: A comparative study and their Environmental Impacts in Haryana
- Intelligent controlled UPQC for power quality improvement of grid supply connected with non-linear load
- Overlapped Fingerprint Separation for Fingerprint Authentication
- Light Weight Concrete with Full Replacement for Fine and Partial Replacement for Coarse Aggregate
- Survey on Different Methods of Digital Audio Watermarking
- The Experimental Behavior Researches of the Reinforced Concrete Beams Bending Stressed By Short – Time Load
- A Survey on Skin Cancer Detection System
- Design of 32-bit Floating Point Unit for Advanced Processors
- Cloud Computing and Security Issues
- Projection of future Temperature and Precipitation for Jhelum river basin in India using Multiple Linear Regression.
- Regional Scale Modelling of Solid Waste Flow in Storm Drains of Urban Cities: The Case Study of the Abiergué Watershed
- Effect of wrist abduction on force applied and response time during touch screen mobile phone use
- Highly Deformable Energy-Dissipating Reinforced Concrete Elements in Seismic Design of Reinforced Concrete Structures
- N-alkylation methods, Characterization and Evaluation of antibacterial activity of some Novel 5-Chloroisatin Derivatives
- BUID: A key for Integrated Core Financial System
- I0706045861.pdf
- A Mathematical model for Impact of citalopram on the HPA system and combined DEX/CRH test in 30 unipolar depressed patients.
- H0706045257.pdf
- Rice Transplanting Machine
- L0706047175.pdf
- Synthesis, Characterization, and Antibacterial Activity of Some Novel 5-Chloroisatin Derivatives
- N0706048588.pdf
- M0706047684.pdf
- Q070604106112.pdf
- J0706046265.pdf
- Multi-Hop Routing Cooperative Communication for Improving Throughput in IEEE 802.11x Wireless LAN
- K706046670.pdf
- An Improved Personal Security System
- Cooperative Communication for Multi-Hop Routing in ZigBee Network
- Internet Of Things: Architecture,Issues and Applications

**Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

RESEARCH ARTICLE

www.ijera.com

OPEN ACCESS

**Cryptographic Technique Used Lower and Upper Triangular
**

Decomposition Method

B. KumaraswamyAchary, K. Rama Krishna Prasad, V. Vasu

Department of Mathematics, S.V. University, Tirupati

Abstract:

In this paper, the main cryptographic technique we will use affine cipher used for encryption and also

decryption by using one of the linear algebra technique lower and upper triangular technique

Key words: Affine cipher, encryption, decryption, lower and upper triangular decomposition.

I.

Introduction:

**An encryption scheme or cryptosystem is a tuple (P, C, K, E, D) with the following properties.
**

P is a set. It is called the plaintext space. Its elements are called plaintext.

C is a set. It is called the cipher text space. Its elements are called cipher text.

K is a set. It is called the key space. Its elements are called keys.

Factorization method:

This method is based on the fact that every matrix A can be expressed as the product of a

lower triangular matrix and an upper triangular matrix provided al the principals minors of a are

non-singular.i.e.

If A=[aij] then

a11 0

a11

a11

a12

a21 a22

a12

0, a21 a22

a31

a32

a13

a23 0etc

a32

Also such a factorization if it exists, is unique. Now consider the equations.

a11 x1 a12 x2 a13 x3 b1

**a21 x1 a22 x2 a23 x3 b2
**

a31 x1 a32 x2 a33 x3 b3

Which can be written as AX=B where

a11

a12

A a21 a22

a31

a13

x1

b1

a23 , X x2 , B b2

a32

a33

x3

b3

1

0

0

u11

u12

u13

L l21

1

0 and U 0

1

0

u22

u23

0

u33

Let A= LU

Where

l31 l32

**Then (1) becomes LUX=B
**

Writing UX=V1

(3) Becomes LV=B which is equivalent to the equations

V1=b1:l2V1+V2=b2:l31v1+l32v2+v3=b3

Solving these for V1, V2, V3 we know V1 then

(4) Becomes

U11X1+U12X2+U13X3=V11U22X2+U23X3=V21

www.ijera.com

111|P a g e

**SurajoAbubakar WadaInt. Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

www.ijera.com

U33X3=V3

From which x3,x2 and x1 can be found by back-substitution. To compute matrices L and U, we

write (2) as

1

0

0 u11 u12

l21

1

0 0

l31 l32

0 0

a12

a13

u22 u23 a21 a22

a23

0

u13

u33

a11

a31

a32

a33

**Multiplying the matrices on the left and equating corresponding elements from both sides,
**

we obtain

i)

U11=all, u12=a12, u13=a13.

ii)

L21u11=a21 (or) l21=a21/a11.

L31u11=a31 (or) l31=a31/all.

iii)

L21u21+u22=a22 (or) u22=a22-a21/all a12.

L21u13+u23=a23 (or) u23=a23-a21/a11a13.

iv)

L31u13+l32u22=a32 (or) l32=1/u22 [a32-a31/a11 a12]

v)

L31u13+l33u23=a33 (or) which gives u33.

Thus we compute the elements of L and U in the following set order.

i)

First row of U.

ii)

First row of L.

iii)

Second row of U1

iv)

Second row of L1

v)

Third row of U1

This procedure can easily be generalized.

Affine cipher:

The encryption process:

In fact, we can summarizethe encryption which is the process of converting plaintext into

cipher text in the following steps.

a. Choose an (mxm) matrix A=LU which is invertible, where ‘m’ have may be depends on

the length of the message that needs to be encrypted.

b. Change each plain text to its numerical values, by using the table below.

A

B

C

D

E

F

G

H

I

J

K

L

3

4

5

6

7

8

9

10

11

12

13

14

M

N

O

P

Q

R

S

T

U

V

W

X

15

16

17

18

19

20

21

22

23

24

25

0

Y

Z

1

2

c. Form the (mx1) column vector P, having these numerical values as its entries.

d. Get each ciphertext vector C by multiplying A=LU with P and connect each entry of the

ciphertext vector to its letter in the alphabet where L is lower triangular matrix and U is

upper triangular matrix.

The encryption algorithm of this method is C=LUP mod N.

Where C is the column vector of the numerical values of ciphertext, P is the column vector of

the numerical values of the plaintext, LU AN (mxm) matrix, is the key of the algorithm (this matrix

must be invertible because are need the inverse of this matrix for the decryption process) and N is the

number of letters of the alphabet used in the cryptography the decryption process:

The decryption which is the process of converting the cipher text into plaintext could also be

summarized in the following steps:

a. Get the inverse of the matrix LU: say (LU) -1.

b. Change each ciphertext to its numerical values.

c. Put each ciphertext in (mx1) column vector say C.

www.ijera.com

112|P a g e

**SurajoAbubakar WadaInt. Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

www.ijera.com

**d. Get each plaintext vector by multiplying (LU)-1 with C, and connect each plaintext vector to
**

its letter in the alphabet. The decryption algorithm of this method is P (LU)-1 mod N. where

(LU)-1 is the inverse of the matrix LU.

In general, if A= LU

1 0 0

u11 u12 u13

Where L l21 1 0 U 0 u22 u23

l31 l32 1

0

0 u33

P11

And P ... then in the encryption process, we get C= LUP mod N.

Pu1

C11 1 0

... l21 1

Cu1 l31 l32

**0 u11 u12 u13 p11
**

0 0 u22 u23 ...

1 0

0 u33 pnn

**Here when the size of the matrix A increases, or in other words when increases we will have
**

the following advantages.

1. The cryptography process will be more complex and more difficult to decode.

2. The number of column vectors will decreases and we can encode any message consisting for

example of 7 letters by using A(7x7) matrix in only one step. But there is one problem here,

that is, it’s not easy to get the inverse of the matrix used in the encryption process as n

increases.

Below, we give several other ways of using affine cipher technique for encryption.

We can use the affine cipher technique to make the hill cipher more complex encryption

algorithm here is given as

C=LUP+B (mod N)

c11 1 0

... l21 1

c l

n1 31 l32

**0 u11 u12 u13 b11 ... b1n
**

0 0 u22 u23 ... ... ...

1

0 u33 bn1 .... bnn

0

**Where A=LU is an invertible matrix and B is a column vector like the vectors C and P.
**

For the decryption

P=LU-1C-LU-1B= LU-1(C-B) (mod N)

Example 1: Encode the message (welcome) by using affine cipher algorithm where the matrix is

4 1

A

2 3

Sol: First use the table below to convert letters in the message to their numerical values.

A

B

C

D

E

F

G

H

I

J

K

L

3

4

5

6

7

8

9

10

11

12

13

14

M

N

O

P

Q

R

S

T

U

V

W

X

15

16

17

18

19

20

21

22

23

24

25

0

Y

Z

1

2

Put also number O for the space between words. Group the plaintext letters into pairs and

add O to fill out the last pairs.

W

E

L

C

O

M

E

T

O

25

7

14

5

17

15

7

0

22

17

0

www.ijera.com

113|P a g e

**SurajoAbubakar WadaInt. Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

www.ijera.com

U12

4 1 1 0 U11 U12 U11

A

2 3 l21 1 0 U 22 l21U11 l21U12 U 22

U11=4 V12=1, L21U12+U22=3

L21U11=2

½ 1+V22=3

L21=2/4=1/2

V22=3-1/2=5/2

1 0

4 1

L

, U

1/ 2 0

0 5 / 2

**C LUB mod 26
**

1

C1

1/ 2

1

C2

1/ 2

1

C3

1/ 2

1

C4

1/ 2

1

C5

1/ 2

0 4

0 0

0 4

0 0

0 4

0 0

0 4

0 0

0 4

0 0

1 25 3

mod 26

5 / 2 7 19

1 14 9

mod 26

5 / 2 5 17

1 17 5

mod 26

5 / 2 15 1

1 7 2

mod 26

5 / 2 0 14

1 22 1

mod 26

5 / 2 17 17

**Now the message becomes
**

3

19

9

17

5

1

2

14

A

W

G

O

C

Y

Z

L

Example 2: Encoding the message (Application of Mathematics)

1

Y

17

O

3 2 7

a 2 3 1

3 4 1

1 0 0 u11 u12 u13

Let A UL l21 1 0 0 u22 u23

l

0 u33

31 l32 1 0

3 2 7 1 0 0 u11 u12 u13

2 3 1 l21 1 0 0 u22 u23

3 4 1 l31 l32 1 0

0 u33

So that

(i)

U11=3, U12= 2, U13=7

(ii)

L21U11=2, L31U11=3, L21=2/3

L31=1

(iii)

L21U12+U22=3, L21U13+U23=1

V22=5/3

U23=11/3

(iv)

L31U12+L32U22=4

L32=6/5

(v)

L31U13+L32U23+U33=1

U33=-8/5

www.ijera.com

114|P a g e

**SurajoAbubakar WadaInt. Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

www.ijera.com

0 0 3 2

7

1

1 0 0 5 / 3 11/ 3

Thus A LV 2 / 3

1 6 / 5 1 0 0

8 / 5

Application of Mathematics

3 18 18 14 11 3 22 11 17 16 178 15 3 22 10 7 15 3 22 11 5 2 1

C=LUP mod M

0

1

C1 2 / 3 1

1 6 / 5

0

1

C2 2 / 3 1

1 6 / 5

0 3 2

7 3 15

0 0 5 / 3 11/ 3 18 0 mod 26

1 0 0

8 / 5 18 21

0 3 2

7 14 21

0 0 5 / 3 11/ 3 11 14 mod 26

1 0 0

8 / 5 5 13

0 0 3 2

7 3 0

1

C3 2 / 3 1 0 0 5 / 3 11/ 3 22 5 mod 26

1 6 / 5 1 0 0

8 / 5 11 4

0 0 3 2

7 17 20

1

C4 2 / 3 1 0 0 5 / 3 11/ 3 16 21 mod 26

1 6 / 5 1 0 0

8 / 5 17 2

0 0 3

1

C5 2 / 3 1 0 0

1 6 / 5 1 0

0 0 3

1

C6 2 / 3 1 0 0

1 6 / 5 1 0

0 0 3

1

C7 2 / 3 1 0 0

1 6 / 5 1 0

0 0 3

1

C8 2 / 3 1 0 0

1 6 / 5 1 0

15

M

5

C

9

G

8

F

**The new message becomes
**

0

21

21

14

X

S

S

L

4

20

21

2

B

R

S

Z

5

3

9

23

C

A

G

Y

20

22

R

T

www.ijera.com

8 23

5 / 3 11/ 3 15 12 mod 26

0

8 / 5 3 9

2

7 22 5

5 / 3 11/ 3 10 3 mod 26

0

8 / 5 7 9

2

7

15 23

5 / 3 11/ 3 3 9 mod 26

0

8 / 5 22 1

2

7 11 8

5 / 3 11/ 3 5 20 mod 26

0

8 / 5 21 22

2

7

13

K

23

U

9

G

0

K

12

J

1

Y

115|P a g e

**SurajoAbubakar WadaInt. Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

www.ijera.com

**Example 3: Decode the message SNOITAUQE RAENIL by using Caesar cipher algorithm and the
**

inverse of the matrix

3 2 1

A 4 1 1

2 0 1

Solution:

21

16

S

N

19

7

W

E

17

O

20

R

1 0

A LU l21 1

l31 l32

14

I

3

A

22

T

7

E

3

A

16

N

23

U

11

I

14

L

**0 u11 u12 u13
**

0 0 u22 u23

1 0

0 u33

So that

i.

U11=3, U12= -2, U13=-1

ii.

L21U11=-4, L21U12+U22=1, L21U13+U23=-1

L21=-4/3

U22=-5/3

U23=-7/3

iii.

L31U11=2

L31U12+L32U22=0

L31=2/3 2/3-2+5/3L33=0

L32=-4/5

iv.

L31U13+L32U23+U33=1

2/3(-1)+-4(-7/5)+U33=1

-2/3+28/5+U33=1

U33=-69/5

0

0

1

1

3 2

L 4 / 3

1

0 U 0 5 / 3 7 / 3

2 / 3 4 / 5 1

0

0

59 /15

P= (LU)-1 mod26

1 2 3 21 0

0

P1 2 5 7 16 7 mod 26 7

2 4 5 17 9

17

1 2 3 14 15

15

P2 2 5 7 22 3 mod 26 3

2 4 5 3 1

25

1 2 3 23 4

4

P3 2 5 7 19 8 mod 26 8

2 4 5 7 1

25

www.ijera.com

116|P a g e

**SurajoAbubakar WadaInt. Journal of Engineering Research and Applications
**

ISSN: 2248-9622, Vol. 6, Issue 2, (Part - 4) February 2016, pp.111-107

www.ijera.com

1 2 3 20 21

21

P4 2 5 7 3 24 mod 26 24

2 4 5 7 9

17

1 2 3 16 2

2

P5 2 5 7 11 3 mod 26 3

2 4 5 14 16

10

The remaining values are

0

7

17

15

A

E

O

M

4

8

25

21

B

F

W

J

2

3

10

Z

A

H

The new message

AEOMAW BFW SVO ZAH

3

A

24

V

25

W

17

O

References:

[1] Charles C. Pinter A Book of Abstract algebra second edition

[2] Higher engineering mathematic khanna publishers by Dr. B.S. Grewal 40 th edition

[3] Joseph A Gallian contemporary abstract algebra sixth edition 2006

[4] P.B. Bhattachary SK Jain S.R. Nagpaul First course in Linear Algebra 1983

www.ijera.com

117|P a g e

- 10916136 Malware Resilient Strong Authentication and Crypto Software as Service is ReleasedUploaded byeligahu
- A Review Based Study of Hybrid Security Schemes Based on Compression, Encryption and SteganographyUploaded byseventhsensegroup
- Image Encryption Using Advanced Hill Cipher AlgorithmUploaded byIDES
- Computer Security AssignmentUploaded byIsraa Hafiqah
- RSA Introduction and SummaryUploaded bykvenlife
- IS -IntroUploaded byramshah7777777
- IJAIEM-2014-10-31-92Uploaded byAnonymous vQrJlEN
- Cryptography.docUploaded bygerosuarezyahoo
- tuitorial 2.txtUploaded byRasika Atapattu
- e 124450Uploaded bywww.irjes.com
- Wikireader CryptographyUploaded byRaghu Kisore
- IRJET-An Enhanced Encryption Technique using BCD and Bit ComplementationUploaded byIRJET Journal
- rfidUploaded byArunKumar
- IRJET-Enhanced Cloud Data Security using Combined Encryption and SteganographyUploaded byIRJET Journal
- Lecture 19Uploaded byCarlos Gean R. Lopes
- NEM TechRefUploaded byYo Saucedo
- Ch1 - OverviewUploaded byJamie Berardi
- AIS Chap 9.pdfUploaded byPhupungPrasiwi
- icisc04Uploaded byEdin Pašić
- CN_LabmanualUploaded byNikhil Gs
- Vital Investigation of Data in Hybrid CloudUploaded byIJRASETPublications
- A Critical Reassessment OfUploaded byijcisjournal
- Hybrid Selective SteganographyUploaded byIJARP Publications
- EEA &EIAUploaded byMohamed Yaacoub
- chapter_0_welcome.pdfUploaded byAdi Huseinbegovic
- Permutation of Pixels within the Shares of Visual Cryptography using KBRP for Enhanced SecurityUploaded byIDES
- Dirceu InternetSecurityUploaded byJohn York
- Palladium_CryptographyUploaded byNaresh Heda
- Ontology in Information Security 2001 RaskinUploaded byChukiat Sakjirapapong
- CS50 Notes All WeeksUploaded byFTange

- Inland Surface Water Analysis: A comparative study and their Environmental Impacts in HaryanaUploaded byAnonymous 7VPPkWS8O
- Intelligent controlled UPQC for power quality improvement of grid supply connected with non-linear loadUploaded byAnonymous 7VPPkWS8O
- Overlapped Fingerprint Separation for Fingerprint AuthenticationUploaded byAnonymous 7VPPkWS8O
- Light Weight Concrete with Full Replacement for Fine and Partial Replacement for Coarse AggregateUploaded byAnonymous 7VPPkWS8O
- Survey on Different Methods of Digital Audio WatermarkingUploaded byAnonymous 7VPPkWS8O
- The Experimental Behavior Researches of the Reinforced Concrete Beams Bending Stressed By Short – Time LoadUploaded byAnonymous 7VPPkWS8O
- A Survey on Skin Cancer Detection SystemUploaded byAnonymous 7VPPkWS8O
- Design of 32-bit Floating Point Unit for Advanced ProcessorsUploaded byAnonymous 7VPPkWS8O
- Cloud Computing and Security IssuesUploaded byAnonymous 7VPPkWS8O
- Projection of future Temperature and Precipitation for Jhelum river basin in India using Multiple Linear Regression.Uploaded byAnonymous 7VPPkWS8O
- Regional Scale Modelling of Solid Waste Flow in Storm Drains of Urban Cities: The Case Study of the Abiergué WatershedUploaded byAnonymous 7VPPkWS8O
- Effect of wrist abduction on force applied and response time during touch screen mobile phone useUploaded byAnonymous 7VPPkWS8O
- Highly Deformable Energy-Dissipating Reinforced Concrete Elements in Seismic Design of Reinforced Concrete StructuresUploaded byAnonymous 7VPPkWS8O
- N-alkylation methods, Characterization and Evaluation of antibacterial activity of some Novel 5-Chloroisatin DerivativesUploaded byAnonymous 7VPPkWS8O
- BUID: A key for Integrated Core Financial SystemUploaded byAnonymous 7VPPkWS8O
- I0706045861.pdfUploaded byAnonymous 7VPPkWS8O
- A Mathematical model for Impact of citalopram on the HPA system and combined DEX/CRH test in 30 unipolar depressed patients.Uploaded byAnonymous 7VPPkWS8O
- H0706045257.pdfUploaded byAnonymous 7VPPkWS8O
- Rice Transplanting MachineUploaded byAnonymous 7VPPkWS8O
- L0706047175.pdfUploaded byAnonymous 7VPPkWS8O
- Synthesis, Characterization, and Antibacterial Activity of Some Novel 5-Chloroisatin DerivativesUploaded byAnonymous 7VPPkWS8O
- N0706048588.pdfUploaded byAnonymous 7VPPkWS8O
- M0706047684.pdfUploaded byAnonymous 7VPPkWS8O
- Q070604106112.pdfUploaded byAnonymous 7VPPkWS8O
- J0706046265.pdfUploaded byAnonymous 7VPPkWS8O
- Multi-Hop Routing Cooperative Communication for Improving Throughput in IEEE 802.11x Wireless LANUploaded byAnonymous 7VPPkWS8O
- K706046670.pdfUploaded byAnonymous 7VPPkWS8O
- An Improved Personal Security SystemUploaded byAnonymous 7VPPkWS8O
- Cooperative Communication for Multi-Hop Routing in ZigBee NetworkUploaded byAnonymous 7VPPkWS8O
- Internet Of Things: Architecture,Issues and ApplicationsUploaded byAnonymous 7VPPkWS8O