仿射密码

仿射密码

import java.util.Scanner;

/**
 * 仿射密码的加密和解密
 * n = 26
 */
public class Affine {
    public static final int n = 26;

    public static void main(String[] args) {
        // 输入秘钥
        Scanner input = new Scanner(System.in);
        System.out.println("请输入密钥k1:");
        int k1 = input.nextInt();
        System.out.println("请输入密钥k2:");
        int k2 = input.nextInt();
        System.out.println("[1 加密][2 解密],请选择一个");
        Scanner c = new Scanner(System.in);// 创建Scanner对象
        String s1 = c.nextLine();// 获取本行的字符串

        // 加密
        if (s1.equalsIgnoreCase("1")) {// 判断变量s1与A是否相等，忽略大小
            System.out.println("请输入明文：");
            Scanner sc = new Scanner(System.in);
            String s = sc.nextLine();
            System.out.println(Encryption(k1, k2, s));// 调用Encryption方法
        } 

        // 解密
        else if (s1.equalsIgnoreCase("2")) {
            System.out.println("请输入密文:");
            Scanner sc = new Scanner(System.in);
            String s = sc.nextLine();
            System.out.println(Decrypt(k1, k2, s));    
        }
    }

    /**
     * 加密：C= Ek(m)=(k1m+k2) mod n
     * @param k1
     * @param k2
     * @param express
     * @return string
     */
    public static String Encryption(int k1, int k2, String express){
        //转化成小写并去除空格
        String express2 = express.toLowerCase().replaceAll(" ", "");
        
        char[] expressChar = express2.toCharArray();
        int[] jiamiChar = new int[express2.length()];

        //将字母转换成数字表示
        for (int i=0;i<express2.length();i++){
            jiamiChar[i] = ((expressChar[i] - 97) * k1 + k2) % n; //97 = a
        }

        //拼凑密文
        StringBuffer miwen = new StringBuffer();
        for(int j=0;j<jiamiChar.length;j++){
            miwen = miwen.append((char)(jiamiChar[j] + 65));
        }
        return miwen.toString();
    }

    /**
     * 解密
     * @param k1
     * @param k2
     * @param ciphertext
     * @return string
     */
    public static String Decrypt(int k1, int k2, String ciphertext){
        //1.求出k3 { (k3 * k1) mod 26 = 1 }:
        int k3 = 0;
        for (int i = 2;;i++){
            if((i*k1) % n == 1){
               k3 = i;
               break;
            }
        }

        //求出明文  { M= Dk(c)=k3(c- k2) mod n }
        StringBuffer mingwen = new StringBuffer();
        for (int j=0;j<ciphertext.length();j++){
            int c = ((k3 * (ciphertext.charAt(j) - 65 - k2))) % 26;
            if (c < 0){
                c = c + 26;
            }
            mingwen.append((char)( c + 65));
        }

        return mingwen.toString();
    }

}