本文實(shí)例為大家分享了java實(shí)現(xiàn)仿射密碼加密解密的具體代碼，供大家參考，具體內(nèi)容如下
加密：將明文轉(zhuǎn)化為對(duì)應(yīng)的數(shù)字，如 ‘a'-> 0, ‘b'->1,…,'1'->26,'2'->27,…然后將數(shù)字進(jìn)行仿射運(yùn)算，求取出來的數(shù)字再轉(zhuǎn)化為字符。即 密文=(k1*明文+k2)mod36
解密：密文轉(zhuǎn)化為對(duì)應(yīng)數(shù)字，然后進(jìn)行仿射的逆運(yùn)算，得到對(duì)應(yīng)數(shù)字，然后將其轉(zhuǎn)化為字符明文。解密 k3是k1的乘法逆元
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
import java.util.scanner;public class affine{ public static void main(string[] args) { char[] form = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0' , '1', '2', '3', '4', '5', '6', '7', '8', '9'}; scanner sc = new scanner(system.in); system.out.println("請(qǐng)輸入待加密的明文："); string mingwen = sc.nextline(); mingwen=mingwen.touppercase();//將輸入的明文全部大寫 final int k1 = 103; final int k2 = 103; final int k3 = 31; int [] ciphernum=new int[mingwen.length()];//用來存儲(chǔ)數(shù)字化的密文 encryption(mingwen,form,k1,k2,ciphernum); decryption(form,mingwen,k2,k3,ciphernum); } public static void encryption(string mingwen,char[] form,int k1,int k2,int[] ciphernum){ //第一步：將明文存入數(shù)組 char[] pla=new char[mingwen.length()]; for (int i = 0; i <mingwen.length() ; i++) { pla[i]=mingwen.charat(i); }//已將明文存入字符數(shù)組pla中 //第二步：通過腳標(biāo)找到明文中每個(gè)字符對(duì)應(yīng)的數(shù)，參與加密運(yùn)算 int[] mingwennumber=new int[pla.length]; for (int i = 0; i <pla.length ; i++) { for (int j = 0; j <form.length ; j++) { if (form[j]==pla[i]) { mingwennumber[i] = j; } } } //通過腳標(biāo)將明文全部轉(zhuǎn)化為數(shù)字 char[] cipher = new char[mingwen.length()];//cipher密碼數(shù)組 用來存儲(chǔ)密文 for (int i = 0; i <mingwen.length() ; i++) { int a= math.floormod((k1*mingwennumber[i]+k2),36); ciphernum[i]=a; cipher[i]=form[a]; //計(jì)算密文并存入數(shù)組中 } system.out.println("加密結(jié)果是："); system.out.println(cipher); } public static void decryption(char[] form,string mingwen,int k2,int k3,int[] ciphernum){ char[] jiemi=new char[mingwen.length()]; for (int i =0;i<mingwen.length();i++){ jiemi[i]=form[math.floormod(k3*(ciphernum[i]-k2),36)]; } system.out.println("解密結(jié)果是："); system.out.println(jiemi); }} |
以上就是本文的全部?jī)?nèi)容，希望對(duì)大家的學(xué)習(xí)有所幫助，也希望大家多多支持服務(wù)器之家。
原文鏈接：https://blog.csdn.net/rtx_2080/article/details/86523035
