13 reputation
3
bio website
location
age
visits member for 2 years
seen Sep 30 '12 at 14:54

Jul
17
awarded  Popular Question
Mar
7
awarded  Student
Sep
15
awarded  Scholar
Sep
15
accepted Calculating the inverse modularity of the determinant for Hill cipher
Sep
10
comment Calculating the inverse modularity of the determinant for Hill cipher
I think it's just a case where it is not possible to perform the decryption as I have to use the same key. I would be tempted to consider the case of 29 caracters but I'm pretty sure it's a 26 caracters alphabet(a=0,..z=25). Thank you for your help guys!
Sep
10
comment Calculating the inverse modularity of the determinant for Hill cipher
Thank you @poncho I've just found that few seconds ago. Is it possible to find another key to solve the problem?
Sep
10
comment Calculating the inverse modularity of the determinant for Hill cipher
I have the key matrix and I need to find the plaintext. So I need to calculate the inverse of K. For that I have to solve this equation K × K^(-1) = I (mod 26) I have the determinant but the inverse should be calculated in the way that d × d^(-1) = 1 (mod 26). I don't know how to find d^(-1).
Sep
10
asked Calculating the inverse modularity of the determinant for Hill cipher