Introduction - If you have any usage issues, please Google them yourself
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.
Packet : 1985487hill.rar filelist
密码学实验一_Hill算法实验\Hill算法可执行文件.exe
密码学实验一_Hill算法实验\Hill算法实验报告.doc
密码学实验一_Hill算法实验\Hill算法实验说明文档.doc
密码学实验一_Hill算法实验\Hill算法源代码.java
密码学实验一_Hill算法实验\Hill算法程序JAR.jar
密码学实验一_Hill算法实验\README.txt
密码学实验一_Hill算法实验