Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 80 of 80

A school coding club sends secret numbers in pairs.

Question 805 marksHard

A school coding club sends secret numbers in pairs. A message pair is written as a column X=[xy]X=\begin{bmatrix} x \\ y \end{bmatrix} and is sent as the column Y=EXY=EX, where

E=[5273]E=\begin{bmatrix} 5 & 2 \\ 7 & 3 \end{bmatrix}

The receiver decodes with a square matrix DD chosen so that DE=IDE=I, because then DY=D(EX)=(DE)X=XDY=D(EX)=(DE)X=X.

Attempt any four of the following five sub-questions.

(a) Encode the message pair x=4x=4, y=9y=9.

(b) The decoding matrix has the form D=[3pq5]D=\begin{bmatrix} 3 & p \\ q & 5 \end{bmatrix}. Use DE=IDE=I to find pp and qq, and then check that ED=IED=I as well, so that D=E−1D=E^{-1}.

(c) Decode the received pair Y=[3144]Y=\begin{bmatrix} 31 \\ 44 \end{bmatrix}, and check your answer by encoding it again.

(d) For extra security the club encodes twice: first with F=[1101]F=\begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix} and then with EE, so that Y=E(FX)=(EF)XY=E(FX)=(EF)X. Verify that F−1=[1−101]F^{-1}=\begin{bmatrix} 1 & -1 \\ 0 & 1 \end{bmatrix}, write (EF)−1(EF)^{-1} as a single matrix using the rule for the inverse of a product, and decode the received pair [4361]\begin{bmatrix} 43 \\ 61 \end{bmatrix}. Show that undoing the two steps in the wrong order gives a different pair.

(e) A member proposes encoding with G=[2613]G=\begin{bmatrix} 2 & 6 \\ 1 & 3 \end{bmatrix} instead. Find two different message pairs that GG encodes to the same pair, and use them to prove that GG has no inverse.