Professional Documents
Culture Documents
A - Note - On - The - Application - of - Quadratic - Forms - in - Coding Theory
A - Note - On - The - Application - of - Quadratic - Forms - in - Coding Theory
ABSTRACT
1. Introduction
1.1 Theorem
78
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
Proof :
2. Basics
I LOVE VINODHINI
To every letter we will associate a number. The easiest way to do that is to associate 0 to
a blank or space, 1 to A, 2 to B, etc... Another way is to associate 0 to a blank or space, 1
to A, -1 to B, 2 to C, -2 to D, etc... Let us use the second choice. So our message is given
by the string as
I L O V E V I N O D H I N I
5 0 -6 8 -11 3 0 -11 5 -7 8 -2 -4 5 -7 5
Now we rearrange these numbers into a matrix M (Row wise e/ Coolum wise).we use
column wise. For our case, we have
5 0 − 4
0 − 11 5
−6 5 − 7
M= of order (6 × 3) (Using Theorem)
8 −7 5
− 11 8
0
3
− 2 0
− 1 5 − 1 57 − 5 46
−1
A = − 2 11 7 whose inverse is given by A = 11 − 1 9
1 −5 2 − 1 0 − 1
Then, we get
79
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
5 0 − 4
0 − 11 5
− 1 5 − 1
−6 5 − 7
X = MA= − 2 11 7
8 −7 5
− 11 8 1 − 5 2
0
3
− 2 0
−9 45 − 13
27 − 146 − 67
− 11 60 27
=
11 − 62 − 47
−5
33 67
1
− 7 − 17
−9 45 − 13
27 − 146 − 67
57 − 5 46
− 11 60 27
M = XA−1 = 11 − 1 9
11 − 62 − 47
−5 − 1 0 − 1
33 67
1
− 7 − 17
5 0 − 4
0 − 11 5
−6 5 − 7
=
8 −7 5
− 11 8
0
3
− 2 0
80
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
5 0 -6 8 -11 3 0 -11 5 -7 8 -2 -4 5 -7 5
I LOV E V I N O D H I N I
3. Solution Procedure
A text message of strings of some length / size l from the sender is converted in
to a stream of numerals with the help of some coding process (Probably may be the
standard codes like A – 1, B-2,….Z-26 and for space -0 ) which is again converted in to
a matrix (called a message matrix M) of size m× n where
n < m and n is the least such that mx n ≥ l depending up on the length of the
message .In such case the size of the Encoder (The induced Diagonal matrix of a
Quadratic form of suitable variables ) becomes n . Then the Encoder need not be an
arbitrary matrix where as it may be taken as a Diagonal matrix of size n whose inverse
can be readily obtained.
Then the message matrix is converted in to a New Matrix X (Encoded Matrix)
using Matrix Multiplication as X = ME . Then this is sent to the Receiver. Then the
receiver decode this matrix with the help of a matrix D (Decoder matrix) which is
nothing but the inverse of the encoder (i.e., D = E −1 ) , to get the message matrix back as
M = XE −1 .Then with the previously used codes the receiver can get back the message
in terms of the numerals which again can be converted to the original text message. When
the length / size of the text message is too large, the value of n become higher, leading
to the need of higher order diagonal matrices induced from the quadratic forms of higher
number of variables.
3. 1 Algorithm
81
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
1. Place the encrypted stream of numbers that represent the encrypted message
in to a matrix
2. Multiply the encoded matrix X with the decoder D = E −1 (The inverse of E) to
get back the message matrix M
3. Convert this message matrix in to a stream of numbers with the help of the
originally used scheme.
4. Convert this stream of numerals in to the text of the original message.
matrix of the QF is
2 1 − 1
1 − 2 .Also the canonical form is − y1 + y 2 + 4 y 3 whose
2 2 2
1
−1 − 2 1
− 1 0 0
matrix is given by D(−1 , 1 , 4 ) = 0 1 0
0 0 4
− 1 0 0
4. Then we have the Encoder as E = 0 1 0 .
0 0 4
5. Then the encoded matrix is given by
82
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
2 5 19 − 2 5 76
−1 0 0
20 0 23 − 20 0 92
X = ME = 0 1 0 = .
9 19 8 − 9 19 32
5 19 0 0 0 4 − 5 19 0
Hence the encoded numeric message is given by
-2 5 76 -20 0 92 -9 19 32 -5 19 0
=1 0 0
6. Clearly the Decoder E −1 is the given by E −1 = 0 1 0 .
1
0 0
4
7. The encoded numeric message is to be decoded by first writing the
encoded matrix X from the received message as
− 2 5 76 2 5 19
= 1 0 0
−1 − 20 0 92 20 0 23
M = XE = 0 1 0 = .
− 9 19 32 1 9 19 8
− 5 19 0 0 0 4 5 19 0
2 5 19 20 0 23 9 19 8 5 19
4. 1 A word on Security:
In case of using the standard codes one could recognize intuitively
or by any way the codes of use from the codes allotted for the alphabets. So the use of
codes in a random or chaotic way or by using some process , increases the security level.
4.1.1 Example
Instead of using the standard codes A-1, B-2…….Z-26 and 0 for space
If we use the codes assigned as
A-7 , B-6 , C- 5 , D-4 , E-3 ,F-2 ,G-1 , H-8 , I-9 , J-10 , K-11 , L-12 , M-13 . N- 15 , O-
16, P-17 , Q- 18 , R- 19, S-14 , T-20 , U-26 , V-25 , W-24 , X- 23 , Y -22 ,Z- 21. and 0
for space.(In a random way or by using some generator using Number theory or
combinatorics)
Then the message BEST WISHES is given by the matrix
6 3 14 2 5 19
20 0 24 20 0 23
M = Instead of M =
9 14 8 9 19 8
3 114 0 5 19 0
83
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
Any one who intervene the communication uses the standard codes for this
message matrix will get a confusing message like FENT XINHCN.
So the messengers are advised to make use of their convenient system of codes in order
to have higher security level.
5. Operation on Strings:
We define the operator * (The string addition) as usual in the case
of addition of strings.
Example: Best*wishes = Best wishes.
6. Generalization
Using this operation we decompose the messages of larger length in to
messages of shorter lengths and finally these are coined to get the message of larger
length.
1) M E P C O W I S H E S:
13 5 16 3 15 0 23 9 19 8 5 19
13 5 16
3 15 0
2) T1 = .
23 9 19
8 5 19
= 1 0 0 = 1 0 0
3) E = 0 1 0 Such that E = 0 1
−1
0
0 0 4
1
0 0
4
− 13 5 64
− 3 15 0
4) X 1 = T1E = T1 =
− 23 9 76
− 8 5 76
84
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
13 5 16
3 15 0
5) M 1 = X 1 E −1 = 23 9 19
8 5 19
6) Message 1 = 13 5 16 3 15 0 23 9 19 8 5 19
ME PCO W I SHE S
1) Y O U A L L T H E B E S T.
25 15 21 0 1 12 12 0 24 8 5 0 2 5 19 20
25 15 21
0 1 12
12 0 21
2) T2 = .
8 5 0
2 5 19
20 0 0
= 1 0 0 = 1 0 0
3) E = 0 1 0 Such that E = 0 1
−1
0
0 0 4
1
0 0
4
− 25 15 84
0 1 48
− 12 0 84
4) X 2 = T2 E = ,
−8 5 0
− 2 5 76
− 20 0 0
25 15 21
0 1 12
12 0 21
5) M 2 = X 2 E −1 =
8 5 0
2 5 19
20 0 0
6) Message 2 = 25 15 21 0 1 12 12 0 24 8 5 0 2 5 19 20
85
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
Y O U ALL T H E B E S T.
86
B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj.,Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
9. Acknowledgements
The authors are very grateful to Major D.Stephen Jeyapaul , Former Head , Dept
of Mathematics , Thiagarajar College of Engineering , Prof.K.P.Radhakrishnan Former
Head , Dept of Mathematics , Thiagarajar College of Arts Madurai , for their constant
encouragement. The author sincerely thanks Dr.P.S.Boopathi Manickam, Dept of
Humanities and Mr.S.Rajaram, Dept of English for their scholarly suggestions and timely
help. Above all the author dedicates this work to his ever loving family members
particularly to his parents without whom he can’t succeed up to this level.
10. References
87