Scribd
Upload
85 views

Matrix App

Matrices can be used for data encryption in cryptography. The encryption process involves converting a message to numbers, placing them in a matrix, multiplying that matrix by an encoding matrix to produce an encrypted matrix. Decryption reverses this by multiplying the encrypted matrix by the inverse of the encoding matrix. Fibonacci cryptography also uses matrices, specifically generalized Fibonacci matrices called Qp matrices, for encryption by multiplying the initial message matrix by Qp and decryption by the inverse of Qp. This provides theoretically unlimited encryption keys.

Uploaded by

nitin_bala
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
85 views

Matrix App

Matrices can be used for data encryption in cryptography. The encryption process involves converting a message to numbers, placing them in a matrix, multiplying that matrix by an encoding matrix to produce an encrypted matrix. Decryption reverses this by multiplying the encrypted matrix by the inverse of the encoding matrix. Fibonacci cryptography also uses matrices, specifically generalized Fibonacci matrices called Qp matrices, for encryption by multiplying the initial message matrix by Qp and decryption by the inverse of Qp. This provides theoretically unlimited encryption keys.

Uploaded by

nitin_bala
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 25

APPLICATION

OF
MATRICES
WHAT IS A MATRIX?
• In mathematics, a matrix (plural matrices, or less commonly
matrixes) is a rectangular array of numbers, such as
• An item in a matrix is called an entry or an element. Matrices of
the same size can be added and subtracted entrywise and
matrices of compatible sizes can be multiplied. These operations
have many of the properties of ordinary arithmetic, except that
matrix multiplication is not commutative, that is, AB and BA are
not equal in general. Matrices consisting of only one column or
row define the components of vectors, while higher-
dimensional (e.g., three-dimensional) arrays of numbers define
the components of a generalization of a vector called a tensor.
Applications of matrices
FIELD OF APPLICATION OF USAGE
MATRICES

COMPUTER DATA ENCRYPTION

ECONOMICS & COMMERCE CALCULATION OF GDP etc.

POLITICS CASTING POLLS

ENGINEERING MATH REPORT RECORDING

ARCHITECTURE USED ALONG WITH COMPUTING

SCIENTIFIC STUDY MAKING OF GRAPHS AND


STATISTICS
Applications of matrices
In
CRYPTOGRAPHY
What is Cryptography?
• Cryptography, to most people, is concerned
with keeping communications private.
• Encryption is the transformation of data into
some unreadable form. Its purpose is to
ensure privacy by keeping the information
hidden from anyone for whom it is not
intended, even those who can see the
encrypted data.
• Decryption is the reverse of encryption; it is
the transformation of encrypted data back
into some intelligible form.
Why Cryptography?
• Cryptography involves encrypting data so that
a third party can not intercept and read the
data.
• In the early days of satellite television, the
video signals weren't encrypted and anyone
with a satellite dish could watch whatever was
being shown.
• This was a problem so data must be somehow
hidden for this cryptography is used
PROCESS OF ENCRYPTION:
CRYPTOGRAPHY

SECRET KEY PUBLIC KEY


How does Encryption takes place?
Encryption Process:
• Convert the text of the message into a stream
of numerical values.
• Place the data into a matrix.
• Multiply the data by the encoding matrix.
• Convert the matrix into a stream of numerical
values that contains the encrypted message.

STEPS FOR
ENCRYPTION
STEP 1 :
• Consider the message “PREPARE TO
NEGOTIATE"
• A message is converted into numeric form
according to some scheme. The easiest
scheme is to let space=0, A=1, B=2, ..., Y=25,
and Z=26. For example, the message "Red
Rum" would become 18, 5, 4, 0, 18, 21, 13.
STEP 2:
the encoding matrix be

We assign a number for each letter of the alphabet.


For simplicity, let us associate each letter with its
position in the alphabet: A is 1, B is 2, and so on.
Also, we assign the number 27 (remember we have
only 26 letters in the alphabet) to a space between
two words. Thus the message becomes
STEP 3

Since we are using a 3 by 3 matrix, we break the


enumerated message above into a sequence of 3 by 1
vectors:
STEP 4:
• Note that it was necessary to add a space at
the end of the message to complete the last
vector. We now encode the message by
multiplying each of the above vectors by the
encoding matrix. This can be done by writing
the above vectors as columns of a matrix and
perform the matrix multiplication of that
matrix with the encoding matrix as follows:
which gives the matrix
STEP 5:
• The columns of this matrix give the encoded
message. The message is transmitted in the
following linear form
STEP 6 (DECODING):
To decode the message, the receiver writes this
string as a sequence of 3 by 1 column matrices and
repeats the technique using the inverse of the
encoding matrix.
The inverse of this encoding matrix, the decoding
matrix, is:
Thus, to decode the message, perform the
matrix multiplication

and get the matrix


CONCLUDING STEP
The columns of this matrix, written in linear form,
give the original message
FIBONACCI CRYPTOGRAPHY
• The general idea of the Fibonacci
cryptography is similar to the Fibonacci coding
and based on the application of the
generalized Fibonacci matrices, the Qp-
matrices, for encryption and decryption of the
initial message M.

Note that the encryption/decryption key is the pair of the numbers


of p and n. Since p = 0, 1, 2, 3, ... and n =  1,  2,  3, ... this means that
this method has theoretically unlimited number of the
encryption/decryption keys.
STEP 1:
• Let's consider the Fibonacci encryption
method:

• and then the Fibonacci decryption method

It follows from (1) and (2) that the Fibonacci encryption algorithm
(1) is reduced to the
n-multiple multiplication of the initial matrix M by the matrix Qp
and the Fibonacci decryption algorithm is reduced to the n-
multiple multiplication of the secret message E by the inverse
matrix .
STEP 2:
• Let's consider now the multiplication of the
initial matrix M by the matrix Qp. Let's consider
the concrete example when the initial message
is represented in the form of the 4 X4 matrix:
• For this case the Qp-
…….1
matrix of the 4-d order (p +
1 = 4) is used for encryption:
STEP 3:
• For calculation of the matrix of E = M ´ Q3 we
can represent it in the following form:

• After the execution of the matrix multiplication (5) the matrix E


takes the following form:

……….6
CONCLUDING STEP
• Comparing the initial matrix (3) with its secret equivalent (6)
we can formulate the following rule concerning the
multiplication of the initial matrix M by the coding Qp-mat.
• RULE:
For the multiplication of the initial matrix (6) by the inverse
matrix it is necessary to shift all the matrix entries of the initial
matrix (6) to the left by one column, and form the last entries
of each row by means of the subtraction of the second entry
of each row of the initial matrix from its first entry.

Det E = Det M X (-1)pn. (9)


CONCLUSION
• THUS IN THIS WAY DATA CAN BE MADE SAFE AND
MORE PROTECTED FROM THE VARIOUS HACKING
DEVICES

You might also like