信息安全课上简单写的RSA加密算法

RSA.java

import java.math.BigInteger;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        int p = 34;
        int q = 151;
        int e = 7;
        int msg = 2022;

        int d = 0;
        int k = 0;

        int tmp = 65535;

        int n = p * q;
        int fn = (p - 1) * (q - 1);
        boolean condition = false;
        for (int i = 0; i < tmp; i++) {
            k = 0;
            for (int j = 0; j < tmp; j++) {
                if (e * d == k * fn + 1) {
                    condition = true;
                    break;
                } else {
                    k++;
                }
            }
            if (condition) {
                break;
            }
            d++;
        }

        System.out.println("d = " + d);
        System.out.println("k = " + k);

        int[] pk = {n, e};
        int[] sk = {n, d};

        BigInteger b_m=new BigInteger(String.valueOf(msg));
        BigInteger b_n=new BigInteger(String.valueOf(n));
        BigInteger encd=  b_m.pow(e).mod(b_n);
        BigInteger b_de=encd.pow(d).mod(b_n);
        System.out.println("bencrypted:"+encd);
        System.out.println("bendecrypted:"+b_de);
    }
}