Ask your own question, for FREE!
Mathematics 21 Online
OpenStudy (anonymous):

Matrices cryptography question, attached below!

OpenStudy (anonymous):

OpenStudy (anonymous):

very interesting problem. anyone helps her,please. I don't know it well, dare not to say something wrong, but I am eager to know the answer, too.

OpenStudy (anonymous):

The original message was first made into numbers as explained in the problem, then it was formed into a 2*n matrix so that the numbers could be multiplied by the encryption matrix's right side. The resultant product is what you are given in the problem. So, you have an encrypted message that you need to form into a matrix, and you need to find the inverse of the encryption matrix. Then multiply with the inverse encryption matrix on the left and the set of encrypted numbers on the right to get the original numbers. Does it make sense? Try this link for more details: http://aix1.uottawa.ca/~jkhoury/cryptography.htm

OpenStudy (anonymous):

It does make sense, I tried to do it but I'm getting numbers outside of the defined context, so it's not making any sense to me, did you get an answer when you did it?

OpenStudy (anonymous):

Try forming the matrix like this: [ 92 65 48 34] [110 81 57 39] and the multiplication should yield "trapline" which is listed as Neil Bush's codename here: http://en.wikipedia.org/wiki/Secret_Service_codename. Sorry it took awhile to get back - I've been studying for finals.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!