Hill加密算法的基本思想是将l个明文字母通过线性变换将它们转换为k个密文字母。脱密只要做一次逆变换就可以了。密钥就是变换矩阵本身。即

M=m1m2……ml

Ek(M)=c1c2……cl

其中

c1=k11m1+k12m2+……+k1lml

c2=k21m1+k22m2+……+k2lml

……

cl=kl1m1+kl2m2+……+kllml

通常对于字母加解密，使用mod 26的方法。

以上线性方程可以采用矩阵表示。

-Hill encryption algorithm the basic idea is to express the letter l a linear transformation through them is converted to k-secret alphabet. Off to do a secret as long as the inverse transform it. Key is the transformation matrix itself. That is, M = m1m2 ... ... mlEk (M) = c1c2 ... ... cl which c1 = k11m1+ K12m2+ ... ...+ K1lmlc2 = k21m1+ K22m2+ ... ...+ K2lml ... ... cl = kl1m1+ Kl2m2+ ... ...+ Kllml For encryption and decryption usually letters, use the method of mod 26. Above linear equations can be used express matrix.