Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
14 views47 pages

Math 203-2.7

The document discusses cryptography, defined as the practice and study of secure communication techniques against adversaries. It explains the mathematical foundations of cryptographic algorithms, which are designed to be difficult to break, and provides examples of encoding and decoding messages using matrix operations. The document includes practical examples illustrating the encoding and decoding processes using specific matrices.

Uploaded by

88volts
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views47 pages

Math 203-2.7

The document discusses cryptography, defined as the practice and study of secure communication techniques against adversaries. It explains the mathematical foundations of cryptographic algorithms, which are designed to be difficult to break, and provides examples of encoding and decoding messages using matrix operations. The document includes practical examples illustrating the encoding and decoding processes using specific matrices.

Uploaded by

88volts
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 47

2.

7
Applications:
Cryptography

Abdeslem
Lyaghfouri

Cryptography

2.7 Applications: Cryptography

Abdeslem Lyaghfouri

Department of Mathematics and Natural Sciences


AURAK

Spring 2017
2.7
Applications:
Cryptography
Table of contents
Abdeslem
Lyaghfouri

Cryptography

1 Cryptography
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• The word Cryptography comes from the Greek word ‘kryptos’ meaning
‘hidden’.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• Cryptography is the practice and study of techniques for secure


communication in the presence of third parties called adversaries.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• Modern cryptography is heavily based on mathematical theory and computer


science practice.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• Cryptographic algorithms are designed around computational hardness


assumptions,
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• Cryptographic algorithms are designed around computational hardness


assumptions,
• making such algorithms hard to break in practice by any adversary.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• One type of code, which is extremely difficult to break, makes use of a large
matrix to encode a message.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• One type of code, which is extremely difficult to break, makes use of a large
matrix to encode a message.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• One type of code, which is extremely difficult to break, makes use of a large
matrix to encode a message.
• The receiver of the message decodes it using the inverse of the matrix.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• One type of code, which is extremely difficult to break, makes use of a large
matrix to encode a message.
• The receiver of the message decodes it using the inverse of the matrix.
• The first matrix is called the encoding matrix, and its inverse is called the
decoding matrix.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

• We illustrate the method for a 3 × 3 matrix.


2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Let the message be


BUY IBM STOCK
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Set the encoding matrix by


 
−3 −3 −4
 0 1 1 
4 3 4
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We assign a number to each letter of the alphabet.


2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We assign a number to each letter of the alphabet.


• For convenience, let us associate each letter with its position in the alphabet.
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We assign a number to each letter of the alphabet.


• For convenience, let us associate each letter with its position in the alphabet.
• Thus A is 1, B is 2, and so on.
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Let a space between words be denoted by the number 27.


2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Then the digital form of the message is


B U Y - I B M - S T O C K
2 21 25 27 9 2 13 27 19 20 15 3 11
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Since we are going to use a 3 × 3 matrix to encode the message, we break up


the digital message into a sequence of 3 × 1 column matrices as follows:
         
2 27 13 20 11
 21  ,  9  ,  27  ,  15  ,  27 
25 2 19 3 27
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Observe that it was necessary to add two spaces at the end of the message in
order to complete the last column matrix.
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We now put the message into code by multiplying each of the above column
matrices by the encoding matrix.
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We now put the message into code by multiplying each of the above column
matrices by the encoding matrix.
• This can be done conveniently by writing the above column matrices as
columns of a matrix and multiplying that matrix by the encoding matrix.
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We get
  
−3 −3 −4 2 27 13 20 11
 0 1 1   21 9 27 15 27 
4 3 4 25 2 19 3 27
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• We get
  
−3 −3 −4 2 27 13 20 11
 0 1 1   21 9 27 15 27 
4 3 4 25 2 19 3 27
 
−169 −116 −196 −117 −222
= 46 11 46 18 54 
171 143 209 137 233
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• The columns of this matrix give the encoded message.


2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• The columns of this matrix give the encoded message.


• The message is transmitted in the following linear form:

−169, 46, 171, −116, 11, 143, −196, 46, 209, −117, 18, 137, −222, 54, 233
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• To decode the message, the receiver writes this string as a sequence of 3 × 1


column matrices and use the inverse of the encoding matrix, called the
decoding matrix:  
1 0 1
 4 4 3 
−4 −3 −3
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Thus, we get the decoded message


  
1 0 1 −169 −116 −196 −117 −222
 4 4 3  46 11 46 18 54 
−4 −3 −3 171 143 209 137 233
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• Thus, we get the decoded message


  
1 0 1 −169 −116 −196 −117 −222
 4 4 3  46 11 46 18 54 
−4 −3 −3 171 143 209 137 233
 
2 27 13 20 11
=  21 9 27 15 27 
25 2 19 3 27
2.7
Applications:
Cryptography
Cryptography: Example
Abdeslem
Lyaghfouri

Cryptography

• The columns of this matrix, written in linear form, give the original message
2 21 25 27 9 2 13 27 19 20 15 3 11
B U Y - I B M - S T O C K
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Example 1
Decode the message -67, 19, 68, -93, 20, 98, -192, 54, 193 which was encoded
using the matrix  
−3 −3 −4
 0 1 1 
4 3 4
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Solution:
To decode the message, we use the decoding matrix i.e. the inverse of the
encoding matrix  
1 0 1
 4 4 3 
−4 −3 −3
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

    
1 0 1 −67 −93 −192 1 5 1
 4 4 3   19 20 54  =  12 2 27 
−4 −3 −3 68 98 193 7 18 27
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

The columns of this matrix, written in linear form, give the original message
1 12 7 5 2 18 1 27 27
A L G E B R A - -
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Example 2
Decode the message

−52, −33, −35, −23, 81, 63, −5, 3, 41, 32, 36, 32, 39, 35, 5, 5, −37, −21

which was encoded using the encoding matrix


 
4 −3
3 −2
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Solution:
To decode the message, we use the decoding matrix i.e. the inverse of the
encoding matrix  
−2 3
−3 4
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Solution:
  
−2 3 −52 −35 81 −5 41 36 39 5 −37
−3 4 −33 −23 63 3 32 32 35 5 −21
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Solution:
  
−2 3 −52 −35 81 −5 41 36 39 5 −37
−3 4 −33 −23 63 3 32 32 35 5 −21
 
5 1 27 19 14 24 27 5 11
=
24 13 9 27 5 20 23 5 27
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

The columns of this matrix, written in linear form, give the original message
5 24 1 13 27 9 19 27 14 5 24 20 27 23 5 5 27
E X A M - I S - N E X T - W E E K
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Example 3
Encode the message EXAM IS NEXT WEEK using the matrix
 
5 −2
4 −1
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

Solution:
Then the digital form of the message is
E X A M - I S - N E X T - W E E K
5 24 1 13 27 9 19 27 14 5 24 20 27 23 5 5 27
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

We break up the digital message into a sequence of 2 × 1 column matrices as


follows:
                 
5 1 27 19 14 24 27 5 11
, , , , , , , ,
24 13 9 27 5 20 23 5 27
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

We now put the message into code by multiplying each of the above column
matrices by the encoding matrix.
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

  
5 −2 5 1 27 19 14 24 27 5 11
4 −1 24 13 9 27 5 20 23 5 27
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

  
5 −2 5 1 27 19 14 24 27 5 11
4 −1 24 13 9 27 5 20 23 5 27
 
−23 −21 117 41 60 80 89 15 1
=
−4 −9 99 49 51 76 85 15 17
2.7
Applications:
Cryptography
Cryptography
Abdeslem
Lyaghfouri

Cryptography

The message is transmitted in the following linear form:

−32, −4, −21, −9, 117, 99, 41, 49, 60, 51, 80, 76, 89, 85, 15, 15, 1, 17

You might also like