Learn on PengiSaxon Algebra 2Chapter 4: Lessons 31-40, Investigation 4

Investigation 4: Understanding Cryptography

In this Saxon Algebra 2 investigation, Grade 10 students explore cryptography by building substitution ciphers and using the VLOOKUP function in a spreadsheet to encrypt and decrypt messages. Students then advance to matrix multiplication as a second layer of encryption, organizing cipher values into 3Γ—3 matrices and applying an encoding matrix to produce a more secure encrypted message. The lesson also covers how to reverse the process using inverse matrices and a graphing calculator to fully decrypt an encoded string.

Section 1

πŸ“˜ Understanding Cryptography

New Concept

A number replaces each letter of the alphabet, so that all messages consist of a string of numbers.

What’s next

Next, you’ll build your own substitution cipher using a spreadsheet, turning abstract rules into a practical encryption tool.

Section 2

Substitution Cipher

A substitution cipher is a classic encryption method where each letter is replaced by a number based on a secret key. This transforms a readable message into a string of numbers. To decode it, someone needs the exact same key that was used for encryption, which maps the numbers back to their original letters. This is a foundational concept in cryptography.

Encrypting "HI": Using the cipher where H=15 and I=17, the message becomes the number string "15 17".
The word "SECRET" is encrypted as "12 9 5 10 9 14" based on the provided cipher key.

Think of it like a secret decoder ring! Each letter gets a secret number buddy. To send a message, you just swap out the letters for their number partners, turning words into a string of code. To read it, you simply swap them back using the key.

Section 3

Matrix Multiplication for Security

To add a powerful layer of security, the number string from a substitution cipher is organized into matrices. These "cipher matrices" are then multiplied by a secret "encoding matrix." This mathematical operation thoroughly scrambles the original numbers, making the code exponentially harder to crack without knowing the exact encoding matrix used for the encryption process.

Cipher matrix [141249]\begin{bmatrix} 14 & 12 \\ 4 & 9 \end{bmatrix} multiplied by encoding matrix [1βˆ’12βˆ’3]\begin{bmatrix} 1 & -1 \\ 2 & -3 \end{bmatrix} creates a new encrypted matrix [38βˆ’5022βˆ’31]\begin{bmatrix} 38 & -50 \\ 22 & -31 \end{bmatrix}.
The string "14 4 6 12 9 5" is first arranged into a cipher matrix [14124965]\begin{bmatrix} 14 & 12 \\ 4 & 9 \\ 6 & 5 \end{bmatrix} before multiplication.

Swapping numbers is easy to crack. For real security, we put numbers into a grid (a matrix) and scramble them by multiplying with a secret encoding grid. This jumbles the numbers in a complex way, making it much harder for anyone to guess the original message.

Section 4

Decrypting with an Inverse Matrix

Decrypting a message encoded with matrix multiplication requires using the inverse of the original encoding matrix. Each encrypted matrix is multiplied by this inverse matrix. This calculation perfectly reverses the scrambling process, restoring the numbers to their simple substitution cipher form. These numbers can then be translated back into letters using the original cipher key.

To decrypt, multiply the encrypted matrix [E][E] by the inverse of the encoding matrix [A][A]: [E]β‹…[A]βˆ’1[E] \cdot [A]^{-1}.
If [38βˆ’5022βˆ’31]\begin{bmatrix} 38 & -50 \\ 22 & -31 \end{bmatrix} is encrypted, multiplying by [1βˆ’12βˆ’3]βˆ’1\begin{bmatrix} 1 & -1 \\ 2 & -3 \end{bmatrix}^{-1} returns the original cipher matrix [141249]\begin{bmatrix} 14 & 12 \\ 4 & 9 \end{bmatrix}.

How do you unscramble the matrix-encrypted message? You use the ultimate undo button: the inverse matrix! Multiplying the scrambled message by the inverse of the secret encoding grid perfectly reverses the encryption, giving you back the original numbers, which you can then translate to letters.

Book overview

Jump across lessons in the current chapter without opening the full course modal.

Continue this chapter

Chapter 4: Lessons 31-40, Investigation 4

  1. Lesson 1

    Lesson 31: Multiplying and Dividing Rational Expressions

  2. Lesson 2

    Lesson 32: Solving Linear Systems with Matrix Inverses (Exploration: Exploring Matrix Inverses)

  3. Lesson 3

    Lesson 33: Applying Counting Principles

  4. Lesson 4

    Lesson 34: Graphing Linear Equations II

  5. Lesson 5

    Lesson 35: Solving Quadratic Equations I

  6. Lesson 6

    Lesson 36: Using Parallel and Perpendicular Lines

  7. Lesson 7

    Lesson 37: Adding and Subtracting Rational Expressions

  8. Lesson 8

    Lesson 38: Dividing Polynomials Using Long Division

  9. Lesson 9

    Lesson 39: Graphing Linear Inequalities in Two Variables

  10. Lesson 10

    Lesson 40: Simplifying Radical Expressions

  11. Lesson 11Current

    Investigation 4: Understanding Cryptography

Lesson overview

Expand to review the lesson summary and core properties.

Expand

Section 1

πŸ“˜ Understanding Cryptography

New Concept

A number replaces each letter of the alphabet, so that all messages consist of a string of numbers.

What’s next

Next, you’ll build your own substitution cipher using a spreadsheet, turning abstract rules into a practical encryption tool.

Section 2

Substitution Cipher

A substitution cipher is a classic encryption method where each letter is replaced by a number based on a secret key. This transforms a readable message into a string of numbers. To decode it, someone needs the exact same key that was used for encryption, which maps the numbers back to their original letters. This is a foundational concept in cryptography.

Encrypting "HI": Using the cipher where H=15 and I=17, the message becomes the number string "15 17".
The word "SECRET" is encrypted as "12 9 5 10 9 14" based on the provided cipher key.

Think of it like a secret decoder ring! Each letter gets a secret number buddy. To send a message, you just swap out the letters for their number partners, turning words into a string of code. To read it, you simply swap them back using the key.

Section 3

Matrix Multiplication for Security

To add a powerful layer of security, the number string from a substitution cipher is organized into matrices. These "cipher matrices" are then multiplied by a secret "encoding matrix." This mathematical operation thoroughly scrambles the original numbers, making the code exponentially harder to crack without knowing the exact encoding matrix used for the encryption process.

Cipher matrix [141249]\begin{bmatrix} 14 & 12 \\ 4 & 9 \end{bmatrix} multiplied by encoding matrix [1βˆ’12βˆ’3]\begin{bmatrix} 1 & -1 \\ 2 & -3 \end{bmatrix} creates a new encrypted matrix [38βˆ’5022βˆ’31]\begin{bmatrix} 38 & -50 \\ 22 & -31 \end{bmatrix}.
The string "14 4 6 12 9 5" is first arranged into a cipher matrix [14124965]\begin{bmatrix} 14 & 12 \\ 4 & 9 \\ 6 & 5 \end{bmatrix} before multiplication.

Swapping numbers is easy to crack. For real security, we put numbers into a grid (a matrix) and scramble them by multiplying with a secret encoding grid. This jumbles the numbers in a complex way, making it much harder for anyone to guess the original message.

Section 4

Decrypting with an Inverse Matrix

Decrypting a message encoded with matrix multiplication requires using the inverse of the original encoding matrix. Each encrypted matrix is multiplied by this inverse matrix. This calculation perfectly reverses the scrambling process, restoring the numbers to their simple substitution cipher form. These numbers can then be translated back into letters using the original cipher key.

To decrypt, multiply the encrypted matrix [E][E] by the inverse of the encoding matrix [A][A]: [E]β‹…[A]βˆ’1[E] \cdot [A]^{-1}.
If [38βˆ’5022βˆ’31]\begin{bmatrix} 38 & -50 \\ 22 & -31 \end{bmatrix} is encrypted, multiplying by [1βˆ’12βˆ’3]βˆ’1\begin{bmatrix} 1 & -1 \\ 2 & -3 \end{bmatrix}^{-1} returns the original cipher matrix [141249]\begin{bmatrix} 14 & 12 \\ 4 & 9 \end{bmatrix}.

How do you unscramble the matrix-encrypted message? You use the ultimate undo button: the inverse matrix! Multiplying the scrambled message by the inverse of the secret encoding grid perfectly reverses the encryption, giving you back the original numbers, which you can then translate to letters.

Book overview

Jump across lessons in the current chapter without opening the full course modal.

Continue this chapter

Chapter 4: Lessons 31-40, Investigation 4

  1. Lesson 1

    Lesson 31: Multiplying and Dividing Rational Expressions

  2. Lesson 2

    Lesson 32: Solving Linear Systems with Matrix Inverses (Exploration: Exploring Matrix Inverses)

  3. Lesson 3

    Lesson 33: Applying Counting Principles

  4. Lesson 4

    Lesson 34: Graphing Linear Equations II

  5. Lesson 5

    Lesson 35: Solving Quadratic Equations I

  6. Lesson 6

    Lesson 36: Using Parallel and Perpendicular Lines

  7. Lesson 7

    Lesson 37: Adding and Subtracting Rational Expressions

  8. Lesson 8

    Lesson 38: Dividing Polynomials Using Long Division

  9. Lesson 9

    Lesson 39: Graphing Linear Inequalities in Two Variables

  10. Lesson 10

    Lesson 40: Simplifying Radical Expressions

  11. Lesson 11Current

    Investigation 4: Understanding Cryptography