desencrypt.java

该程序包提供了三种加解密算法的源代码：DES、AES和RSA。程序没有使用Java的security库

package myCode.desCroptography;

public class DesEncrypt {
	private byte[] key = null;
	private byte[] tempKey = null;
	private static int[] initPerm = {58, 50, 42, 34, 26, 18, 10, 2
									,60, 52, 44, 36, 28, 20, 12, 4
									,62, 54, 46, 38, 30, 22, 14, 6
									,64, 56, 48, 40, 32, 24, 16, 8
									,57, 49, 41, 33, 25, 17, 9, 1
									,59, 51, 43, 35, 27, 19, 11, 3
									,61, 53, 45, 37, 29, 21, 13, 5
									,63, 55, 47, 39, 31, 23, 15, 7};
	private static int[] invInitPerm =	{40, 8, 48, 16, 56, 24, 64, 32
										,39, 7, 47, 15, 55, 23, 63, 31
										,38, 6, 46, 14, 54, 22, 62, 30
										,37, 5, 45, 13, 53, 21, 61, 29
										,36, 4, 44, 12, 52, 20, 60, 28
										,35, 3, 43, 11, 51, 19, 59, 27
										,34, 2, 42, 10, 50, 18, 58, 26
										,33, 1, 41, 9, 49, 17, 57, 25};
	private static int[] perm1 =	{57, 49, 41, 33, 25, 17, 9
									,1, 58, 50, 42, 34, 26, 18
									,10, 2, 59, 51, 43, 35, 27
									,19, 11, 3, 60, 52, 44, 36
									,63, 55, 47, 39, 31, 23, 15
									,7, 62, 54, 46, 38, 30, 22
									,14, 6, 61, 53, 45, 37, 29
									,21, 13, 5, 28, 20, 12, 4};
	private static int[] perm2 =	{14, 17, 11, 24, 1, 5, 3, 28
									,15, 6, 21, 10, 23, 19, 12, 4
									,26, 8, 16, 7, 27, 20, 13, 2
									,41, 52, 31, 37, 47, 55, 30, 40
									,51, 45, 33, 48, 44, 49, 39, 56
									,34, 53, 46, 42, 50, 36, 29, 32};
	private static int[] extenPerm =	{ 32, 1, 2, 3, 4, 5
										,4, 5, 6, 7, 8, 9
										,8, 9, 10, 11, 12, 13
										,12, 13, 14, 15, 16, 17
										,16, 17, 18, 19, 20, 21
										,20, 21, 22, 23, 24, 25
										,24, 25, 26, 27, 28, 29
										,28, 29, 30, 31, 32, 1};
	private static int[] pPerm =	{16, 7, 20, 21, 29, 12, 28, 17
									,1, 15, 23, 26, 5, 18, 31, 10
									,2, 8, 24, 14, 32, 27, 3, 9
									,19, 13, 30, 6, 22, 11, 4, 25};
	private static int[] shiftTime =	{1, 1, 2, 2, 2, 2, 2, 2 
										,1, 2, 2, 2, 2, 2, 2, 1};
	private static int[] sPerm  =	{0, 0, 1, 6, 2, 3, 4, 5
									,0, 0, 7, 12, 8, 9, 10, 11
									,0, 0, 13, 18,14, 15, 16, 17
									,0, 0, 19, 24,20, 21, 22, 23
									,0, 0, 25, 30,26, 27, 28, 29
									,0, 0, 31, 36,32, 33, 34, 35
									,0, 0, 37, 42,38, 39, 40, 41
									,0, 0, 43, 48,44, 45, 46, 47};
	private static int[][] sFunc = {	{14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
										 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
										 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
										 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13},
										{15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
										 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
										 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
										 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9},
										{10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
										 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
										 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
										 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12},
										{7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
										 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
										 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
										 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14},
										{2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
										 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
										 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
										 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3},
										{12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
										 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
										 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
										 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13},
										{4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
										 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
										 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
										 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12},
										{13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
										 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
										 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
										 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11}  };
	
	public DesEncrypt() {
		key = new byte[8];
		tempKey = new byte[7];
	}
	
	public byte[] encrypt(byte[] origin) {
		byte[] temp = null;
		byte[] key = null;
		byte temp2;
		int n;
		if (origin.length != 8) {
			System.out.println("输入数据不是64位!");
			return null;
		}
		temp = this.initPermutation(origin);//数据初始置换
		//System.out.println("初始置换："+this.byte2hex(temp));
		this.keyPermutation1();//密钥初始置换
		//下面进行16轮变换
		for (n=0; n<16; n++) {
			key = this.generateKey(shiftTime[n]);
			temp = this.repeatTransform(temp, key);
		}
		//32位互换
		for (n=0; n<4; n++) {
			temp2 = temp[n];
			temp[n] = temp[n+4];
			temp[n+4] = temp2;
		}
		temp = this.invInitPermutation(temp);
		return temp;
	}
	
	public byte[] decrypt (byte[] crypt) {
		if (crypt.length != 8) {
			System.out.println("decrypt：输入参数不是64位！");
			return null;
		}
		byte[] temp = null;
		byte temp2;
		byte[] key = new byte[96];//保存16轮的密钥 16*6=96
		byte[] tempkey = null;
		int n, k;
		temp = this.initPermutation(crypt);
//		32位互换
		for (n=0; n<4; n++) {
			temp2 = temp[n];
			temp[n] = temp[n+4];
			temp[n+4] = temp2;
		}
		//以下部分计算16轮的密钥。
		this.keyPermutation1();
		for (n=0; n<16; n++) {
			tempkey = this.generateKey(shiftTime[n]);
			for (k=0; k<6; k++) {
				key[n*6+k] = tempkey[k];//记录密钥
			}
		}
//		下面进行16轮逆变换
		for (n=15; n>=0; n--) {
			for (k=0; k<6; k++) {
				 tempkey[k] = key[n*6+k];//获取密钥
			}
			temp = this.invRepeatTransform(temp, tempkey);
		}
		temp = this.invInitPermutation(temp);
		return temp;
	}
	
	private byte[] hex2byte(String strhex) {
		if (strhex == null) {
			return null;
		}
		int l = strhex.length();
		if (l % 2 == 1) {
			return null;
		}
		byte[] b = new byte[l / 2];
		for (int i = 0; i < (l / 2); i++) {
			b[i] = (byte) Integer.parseInt(strhex.substring(i * 2, i * 2 + 2), 16);
		}
		return b;
	}
	
	private String byte2hex(byte[] b) {
		String hs = "";
		String stmp = "";
		for (int n = 0; n < b.length; n++) {
			stmp = (java.lang.Integer.toHexString(b[n] & 0XFF));
			if (stmp.length() == 1) {
				hs =  hs + "0" + stmp;
			} else {
				hs = hs + stmp;
			}
		}
		return hs.toUpperCase();
	}
	
	private byte[] initPermutation(byte[] data) {
		if (data.length != 8) {
			System.out.println("输入数据不是64位!");
			return null;
		}
		byte[] out = new byte[8];
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<8; m++) {
			out[m] = 0;//先清零
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<8; m++) {
			for (n=0; n<8; n++) {
				k = initPerm[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((data[k1] & ones[k2]) != 0)
					out[m] = (byte) (out[m] | ones[n]);
			}
		}
		return out;
	}
	
	private byte[] invInitPermutation(byte[] data) {
		if (data.length != 8) {
			System.out.println("输入数据不是64位!");
			return null;
		}
		byte[] out = new byte[8];
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<8; m++) {
			out[m] = 0;//先清零
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<8; m++) {
			for (n=0; n<8; n++) {
				k = invInitPerm[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((data[k1] & ones[k2]) != 0)
					out[m] = (byte) (out[m] | ones[n]);
			}
		}
		return out;
	}
	
	private void keyPermutation1() {
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<7; m++) {
			this.tempKey[m] = 0;//先清零
		}
		for (m=0; m<8; m++) {
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<7; m++) {
			for (n=0; n<8; n++) {
				k = perm1[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((this.key[k1] & ones[k2]) != 0)
					this.tempKey[m] = (byte) (this.tempKey[m] | ones[n]);
			}
		}
		return;
	}
	
	private byte[] keyPermutation2(byte[] data) {
		if (data.length != 7) {
			System.out.println("输入数据不是56位!");
			return null;
		}
		byte[] out = new byte[6];
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<6; m++) {
			out[m] = 0;//先清零
		}
		for (m=0; m<8; m++) {
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<6; m++) {
			for (n=0; n<8; n++) {
				k = perm2[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((data[k1] & ones[k2]) != 0)
					out[m] = (byte) (out[m] | ones[n]);
			}
		}
		return out;
	}
	
	//扩展置换。这里为了下一步的计算方便，进行了一点修改。
	private byte[] extenPermutation (byte[] data) {
		if (data.length != 4) {
			System.out.println("输入数据不是32位!");
			return null;
		}
		byte[] out = new byte[6];
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<6; m++) {
			out[m] = 0;//先清零
		}
		for (m=0; m<8; m++) {
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<6; m++) {
			for (n=0; n<8; n++) {
				k = extenPerm[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((data[k1] & ones[k2]) != 0)
					out[m] = (byte) (out[m] | ones[n]);
			}
		}
		return out;
	}
	
	private byte[] pPermutation (byte[] data) {
		if (data.length != 4) {
			System.out.println("输入数据不是32位!");
			return null;
		}
		byte[] out = new byte[4];
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<4; m++) {
			out[m] = 0;//先清零
		}
		for (m=0; m<8; m++) {
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<4; m++) {
			for (n=0; n<8; n++) {
				k = pPerm[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((data[k1] & ones[k2]) != 0)
					out[m] = (byte) (out[m] | ones[n]);
			}
		}
		return out;
	}
	
	//进行密钥左移操作。
	private void shiftKey (int shTime) {
		//只能处理 0-7位的位移。
		byte[] temp = new byte[7];
		int n;
		for (n=0; n<7; n++) {
			temp[n] = (byte) (this.tempKey[n]<<shTime);//左移time次
		}
		for (n=0; n<6; n++) {
			//注意右移是带符号的右移，所以要做一些处理。
			temp[n] = (byte) (temp[n] | ((this.tempKey[n+1]>>(8-shTime))& (0x7f>>(7-shTime))));
		}
		temp[6] = (byte) (temp[6] | (((this.tempKey[3] & 0xf)>>(4-shTime))& (0x7>>(3-shTime))));
		temp[3] = (byte) (temp[3] & 0xf);
		temp[3] = (byte) (temp[3] | ((this.tempKey[3] & 0xf0)<<shTime));
		temp[3] = (byte) (temp[3] | (((this.tempKey[0]>>(4-shTime))& (0x7f>>(3-shTime))) & 0xf0));
		for (n=0; n<7; n++) {
			this.tempKey[n] = temp[n];
		}
		return;
	}
	
	//由总密钥，产生加密密钥。
	private byte[] generateKey (int shTime) {
		byte[] output = null;
		this.shiftKey(shTime);
		output = this.keyPermutation2(this.tempKey);
		return output;
	}
	
	private byte[] sFunction(byte[] data) {
		if (data.length != 6) {
			System.out.println("输入数据不是48位!");
			return null;
		}
		byte[] out = new byte[4];
		byte[] temp1 = new byte[8];
		byte temp2;
		byte[] ones = new byte[8];
		int m, n, k, k1, k2;
		for (m=0; m<8; m++) {
			temp1[m] = 0;//先清零
			ones[m] = (byte) (1<<(7-m));
		}
		for (m=0; m<8; m++) {
			for (n=2; n<8; n++) {
				k = sPerm[m*8+n]-1;//查置换表
				k1 = k/8;
				k2 = k & 7;
				if ((data[k1] & ones[k2]) != 0)
					temp1[m] = (byte) (temp1[m] | ones[n]);
			}
		}
		for (n=0; n<4; n++) {
			temp2 = (byte) (sFunc[n*2][temp1[n*2]]<<4);
			out[n] = (byte) (temp2 | (sFunc[n*2+1][temp1[n*2+1]]));
		}
		return out;
	}
	
	private byte[] repeatTransform(byte[] input, byte[] key) {
		if ((input.length != 8) || (key.length != 6)) {
			System.out.println("repeatTransform 错误的字节长度！");
			return null;
		}
		byte[] output = new byte[8];
		byte[] temp1 = null;
		byte[] temp2 = new byte[4];
		int n;
		for (n=0; n<4; n++) {
			output[n] = input[n+4];
			temp2[n] = input[n+4];
		}
		temp1 = this.extenPermutation(temp2);
		for (n=0; n<6; n++) {
			temp1[n] = (byte)(temp1[n] ^ key[n]);//密钥加法
		}
		temp2 = this.sFunction(temp1);
		temp2 = this.pPermutation(temp2);
		for (n=4; n<8; n++) {
			output[n] = (byte) (temp2[n-4] ^ input[n-4]);
		}
		return output;
	}
	
	private byte[] invRepeatTransform(byte[] input, byte[] key) {
		if ((input.length != 8) || (key.length != 6)) {
			System.out.println("invRepeatTransform 错误的字节长度！");
			return null;
		}
		byte[] output = new byte[8];
		byte[] temp1 = null;
		byte[] temp2 = new byte[4];
		int n;
		for (n=4; n<8; n++) {
			output[n] = input[n-4];
			temp2[n-4] = input[n-4];
		}
		temp1 = this.extenPermutation(temp2);
		for (n=0; n<6; n++) {
			temp1[n] = (byte)(temp1[n] ^ key[n]);//密钥加法
		}
		temp2 = this.sFunction(temp1);
		temp2 = this.pPermutation(temp2);
		for (n=0; n<4; n++) {
			output[n] = (byte) (temp2[n] ^ input[n+4]);
		}
		return output;
	}
	
	public String getKey() {
		return byte2hex(this.key);
	}
	
	public boolean setKey(String keyStr) throws WrongKeyException {
		byte[] key1 = hex2byte(keyStr);
		if (key1.length != 8) 
			throw new WrongKeyException("******密钥长度不是64位！******");
		this.key = key1;
		return true;
	}
	
	public boolean setKey(byte[] key) throws WrongKeyException {
		if (key.length != 8) 
			throw new WrongKeyException("******密钥长度不是64位！******");
		this.key = key;
		return true;
	}
	
	public static void main(String[] args) {
		DesEncrypt des = new DesEncrypt();
		byte[] key = des.hex2byte("0123456789ABCDEF");
		byte[] message = des.hex2byte("5468652071756663");//cipher:A28E91724C4BBA31
		byte[] crypt = null;
		byte[] deCrypt = null;
		System.out.println("原始消息:"+des.byte2hex(message));
		try {
			des.setKey(key);
		} catch (WrongKeyException e) {
			e.printStackTrace();
		}
		crypt = des.encrypt(message);
		deCrypt = des.decrypt(crypt);
		System.out.println("加密消息:"+des.byte2hex(crypt));
		System.out.println("解密消息:"+des.byte2hex(deCrypt));
	}
}