DODGEVIPER13
- 668
- 0
A=9 b=2 c=1 d =15
The discussion focuses on finding the inverse of a 2x2 matrix modulo 26, specifically the matrix A = \(\begin{pmatrix} 5 & 8 \\ 17 & 3 \end{pmatrix}\). The determinant of A is calculated as -121, which is equivalent to 9 modulo 26. The Euclidean algorithm is employed to find the multiplicative inverse of 9 modulo 26, leading to the conclusion that the inverse is 3, as 9 multiplied by 3 equals 1 modulo 26. The final inverse matrix is determined to be \(\begin{pmatrix} 9 & 2 \\ 1 & 15 \end{pmatrix}\).
PREREQUISITESStudents studying linear algebra, cryptographers working with the Hill cipher, and anyone interested in modular arithmetic applications in mathematics.
Once you demonstrate that your answer is correct (which it is), you will have achieved minimum rank at modulo 26 wizardry!DODGEVIPER13 said:Sweet man you are the best, so if I see this on the test I should follow the instructions you gave?
To answer your question directly, yes. I imagine it's an open book exam, your arithmetic has been solid, and I think you're ok with the steps that need to be followed. So you should be set.DODGEVIPER13 said:Sweet man you are the best, so if I see this on the test I should follow the instructions you gave?
That is 100% correct. And as you can probably see - it works out to the unit matrix. Congratulations!DODGEVIPER13 said:ahhh now I take the mod 26 of each number and compare to the unit matrix correct?
Knowing how to invert a matrix is critical to the Hill cipher - otherwise you won't be able to decode the message.DODGEVIPER13 said:Hey I have a question what does finding the inverse actually mean in regards to cryptography? More specifically the Hill cipher. I have done another problem and checked it but I don't actually know what I am finding?
By my calculations (using Excel spread sheet):DODGEVIPER13 said:So let's says the message was originally this: EHQC what would the new matrix give IBAO?