Hill password (Java)

Heart beat number 0822 2020-11-09 22:19:01
hill password java


Hill Password is a traditional cryptosystem . Encryption principle : Choose a second-order invertible integer matrix A be called The encryption matrix of the password , This is the key of this encryption system . The encryption process :

Plaintext letters are grouped in pairs , for example The encryption matrix is a second order matrix , Plaintext is just a group of two letters , If the last group is not enough ( The plaintext length is odd ), Add any letters to make a double , Form a two-dimensional vector group a. Calculation of matrix A Multiply by the vector group a, Get a new two-dimensional column vector b, Check the alphabet and get two letters, which are cipher letters .

in other words , The encryption process is : Plaintext --> Mapping to a digital matrix --> Encrypted matrix --> Map to string ( Ciphertext )

The decryption process is the same , It's just a matrix decryption in the middle ,Hill Password is a traditional cryptosystem .

According to this process , The function codes of each stage are as follows :

  First create a class ,HillCrypto,

The member variables are encryption key matrix and decryption key matrix , Alphanumeric mapping and numeric to alphanumeric mapping

Initialization phase , Instantiate the above member variables , The mapping table is larger , So it's written in a local file for reuse , When creating a map, you need to read the local file .

The contents of the document are as follows :

The code is as follows :

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
public class HillCrypto {
private Map<Character, Integer> table;
private Map<Integer, Character> getPlainMap;
private int[][] encryption = {{1, 1},{0, 3}};
private int[][] decryption;
public HillCrypto(String tableFilePath) {
// TODO Auto-generated constructor stub
int mrow = encryption.length;int mcolumn = encryption[0].length;
this.decryption = new int[mrow][mcolumn];
// The inverse of a second-order matrix , If it's a higher order , Use other methods , For example, the inverse matrix is obtained by dividing the cosine by the determinant , For the determinant, see my other blogs .
decryption[0][0] = (encryption[1][1] * 27 / (encryption[0][0]*encryption[1][1] - encryption[0][1]*encryption[1][0])) % 26;
decryption[0][1] = - (encryption[0][1] * 27 / (encryption[0][0]*encryption[1][1] - encryption[0][1]*encryption[1][0])) % 26;
decryption[1][0] = - (encryption[1][0] * 27 / (encryption[0][0]*encryption[1][1] - encryption[0][1]*encryption[1][0])) % 26;
decryption[1][1] = (encryption[0][0] * 27 / (encryption[0][0]*encryption[1][1] - encryption[0][1]*encryption[1][0])) % 26;
// All the matrices of the algorithm need to take the remainder after being calculated 
for (int i = 0; i < decryption.length; i++) {
for (int j = 0; j < decryption[0].length; j++) {
if (decryption[i][j] < 0) {
decryption[i][j] += 26;
}
}
}
this.print(decryption);
this.table = this.readFile(tableFilePath);
this.getPlainMap = this.mapReverse(table);
}
private void print(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; j++) {
System.out.print(matrix[i][j]+", ");
}
System.out.println();
}
}
// map The key values of the 
private Map<Integer, Character> mapReverse(Map<Character, Integer> table){
Iterator<Character> it = table.keySet().iterator();
Map<Integer, Character> result = new HashMap<Integer, Character>();
while (it.hasNext()) {
Character character = (Character) it.next();
result.put(table.get(character), character);
}
return result;
}
/**
* Read a file locally to create the alphabet , for example A->0, B->1,...,Z->25
* @param tableFilePath
* @return
*/
private Map<Character, Integer> readFile(String tableFilePath) {
File file = new File(tableFilePath);
FileReader fr;
Map<Character, Integer> map = new HashMap<Character, Integer>();
try {
fr = new FileReader(file);
BufferedReader br = new BufferedReader(fr);
String line = "";
String[] kv = null;
while ((line = br.readLine())!= null) {
kv = line.split(",");
// System.out.println(" Read key value pairs :<"+kv[0]+", "+kv[1]+">");
map.put(kv[0].charAt(0), Integer.parseInt(kv[1]));
}
br.close();
fr.close();
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
 e.printStackTrace();
} catch (IOException e) {
// TODO Auto-generated catch block
 e.printStackTrace();
}
return map;
}
}

Ciphertext is a string , According to the map table read , In pairs, it turns into a number matrix :

 /**
* The ciphertext is transformed into two-dimensional vector according to the mapping table
* @return
*/
private int[][] getVectorFromString(String text){
int textLength = text.length();
// System.out.println(" The length of ciphertext is :" + textLength);
int row = textLength;
if (row % 2 != 0) {
row = (row + 1) / 2;
int column = this.encryption.length;
int[][] vector = new int[row][column];
for (int i = 0; i < row-1; i++) {
for (int j = 0; j < column; j++) {
vector[i][j] = this.table.get(text.charAt(i*column + j));
}
}
vector[row-1][column-2] = this.table.get(text.charAt((row-1)*column + column-2));
// this.print(vector);
vector[row-1][column-1] = this.table.get('A');
return this.transpose(vector);
}else {
row = row / 2;
int column = this.encryption.length;
int[][] vector = new int[row][column];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
vector[i][j] = this.table.get(text.charAt(i*column + j));
}
}
return this.transpose(vector);
}
}
// Find matrix transposition 
public int[][] transpose(int[][] matrix){
int row = matrix.length;
int column = matrix[0].length;
int[][] newmatrix = new int[column][row];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
newmatrix[j][i] = matrix[i][j];
}
}
return newmatrix;
}

Both encryption and decryption require matrix multiplication

 // The result of multiplying a matrix by a vector 
public int[][] transform(int[][] matrix, int[][] vector) {
int mrow = matrix.length;
int mcolumn = matrix[0].length;
int column = vector[0].length;
int[][] result = new int[mcolumn][column];
for (int k = 0; k < column; k++) {
for (int i = 0; i < mcolumn; i++) {
for (int j = 0; j < mrow; j++) {
result[i][k] += matrix[i][j] * vector[j][k];
// System.out.printf("result[%d][%d] = %d\n", i, k, result[i][k]);
 }
}
}
for (int i = 0; i < mcolumn; i++) {
for (int j = 0; j < column; j++) {
result[i][j] %= 26;
}
}
return result;
}

From the number matrix back look up the mapping table to get the string

 public char[] getPlain(int[][] table) {
int row = table.length;
int column = table[0].length;
char[] plaintext = new char[row*column];
for (int i = 0; i < column; i++) {
for (int j = 0; j < row; j++) {
plaintext[i*row+j] = this.getPlainMap.get(table[j][i]);
}
}
return plaintext;
}

Then we use an example to demonstrate the process of encryption and decryption :

 public static void main(String[] args) {
String tableFilePath = "src/zhaoke/table.csv";
// Encryption key 

String originPlain = "JAVAISTHEBESTLANGUAGEINTHEWORLD";
System.out.println(" Plaintext :"+originPlain);
HillCrypto hc = new HillCrypto(tableFilePath);
// The encryption process
// First, strings are mapped to numbers 
int[][] plainNum = hc.getVectorFromString(originPlain);
// hc.print(plainNum);
// And then use the encryption matrix to encrypt 
int[][] encryptedPlain = hc.transform(hc.encryption, plainNum);
// And then mapping it to a string is ciphertext 
String cipherPlain = new String(hc.getPlain(encryptedPlain));
System.out.println(" Encrypted ciphertext "+cipherPlain);
// The decryption process
// First, it maps to a number 
int[][] cipherNum = hc.getVectorFromString(cipherPlain);
// hc.print(cipherNum);
// Use decryption matrix to decrypt 
int[][] newtable = hc.transform(hc.decryption, cipherNum);
// Then it maps to plaintext 
String plainText = new String(hc.getPlain(newtable));
System.out.println(" The decrypted plaintext is : "+plainText);
}

Execution results :

 Plaintext :JAVAISTHEBESTLANGUAGEINTHEWORLD
Encrypted ciphertext KCWCBEBXGFXEFJOPBKHUNAHHMOLSDJEC
The decrypted plaintext is : JAVAISTHEBESTLANGUAGEINTHEWORLDA

You can see that the result is correct , It shows that the algorithm is effective , As for why one more A, That's because the plaintext length is odd , In order to map to a two-dimensional vector, we need to round up , A random letter is added to the table lookup phase to make up a double, so there is one more A, But it doesn't affect that we can see that plaintext is "Java is the best language in the world".

 

版权声明
本文为[Heart beat number 0822]所创,转载请带上原文链接,感谢

  1. 【计算机网络 12(1),尚学堂马士兵Java视频教程
  2. 【程序猿历程,史上最全的Java面试题集锦在这里
  3. 【程序猿历程(1),Javaweb视频教程百度云
  4. Notes on MySQL 45 lectures (1-7)
  5. [computer network 12 (1), Shang Xuetang Ma soldier java video tutorial
  6. The most complete collection of Java interview questions in history is here
  7. [process of program ape (1), JavaWeb video tutorial, baidu cloud
  8. Notes on MySQL 45 lectures (1-7)
  9. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  10. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  11. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  12. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  13. 【递归,Java传智播客笔记
  14. [recursion, Java intelligence podcast notes
  15. [adhere to painting for 386 days] the beginning of spring of 24 solar terms
  16. K8S系列第八篇(Service、EndPoints以及高可用kubeadm部署)
  17. K8s Series Part 8 (service, endpoints and high availability kubeadm deployment)
  18. 【重识 HTML (3),350道Java面试真题分享
  19. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  20. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  21. [re recognize HTML (3) and share 350 real Java interview questions
  22. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  23. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  24. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  25. RPC 1: how to develop RPC framework from scratch
  26. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  27. RPC 1: how to develop RPC framework from scratch
  28. 一次性捋清楚吧,对乱糟糟的,Spring事务扩展机制
  29. 一文彻底弄懂如何选择抽象类还是接口,连续四年百度Java岗必问面试题
  30. Redis常用命令
  31. 一双拖鞋引发的血案,狂神说Java系列笔记
  32. 一、mysql基础安装
  33. 一位程序员的独白:尽管我一生坎坷,Java框架面试基础
  34. Clear it all at once. For the messy, spring transaction extension mechanism
  35. A thorough understanding of how to choose abstract classes or interfaces, baidu Java post must ask interview questions for four consecutive years
  36. Redis common commands
  37. A pair of slippers triggered the murder, crazy God said java series notes
  38. 1、 MySQL basic installation
  39. Monologue of a programmer: despite my ups and downs in my life, Java framework is the foundation of interview
  40. 【大厂面试】三面三问Spring循环依赖,请一定要把这篇看完(建议收藏)
  41. 一线互联网企业中,springboot入门项目
  42. 一篇文带你入门SSM框架Spring开发,帮你快速拿Offer
  43. 【面试资料】Java全集、微服务、大数据、数据结构与算法、机器学习知识最全总结,283页pdf
  44. 【leetcode刷题】24.数组中重复的数字——Java版
  45. 【leetcode刷题】23.对称二叉树——Java版
  46. 【leetcode刷题】22.二叉树的中序遍历——Java版
  47. 【leetcode刷题】21.三数之和——Java版
  48. 【leetcode刷题】20.最长回文子串——Java版
  49. 【leetcode刷题】19.回文链表——Java版
  50. 【leetcode刷题】18.反转链表——Java版
  51. 【leetcode刷题】17.相交链表——Java&python版
  52. 【leetcode刷题】16.环形链表——Java版
  53. 【leetcode刷题】15.汉明距离——Java版
  54. 【leetcode刷题】14.找到所有数组中消失的数字——Java版
  55. 【leetcode刷题】13.比特位计数——Java版
  56. oracle控制用户权限命令
  57. 三年Java开发,继阿里,鲁班二期Java架构师
  58. Oracle必须要启动的服务
  59. 万字长文!深入剖析HashMap,Java基础笔试题大全带答案
  60. 一问Kafka就心慌?我却凭着这份,图灵学院vip课程百度云