Every useful cipher must have a procedure for decipherment. In the case of a Hill cipher, decipherment uses the inverse (mod 26) of the enciphering matrix To be precise, if m is a positive integer, then a square matrix A with entries in said to be invertible modulo m if there is a matrix B with entries in