cn.hutool.crypto.symmetric.XXTEA Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of hutool-crypto Show documentation
Hutool 加密解密
There is a newer version: 5.8.33
package cn.hutool.crypto.symmetric;

import cn.hutool.core.io.IoUtil;

import java.io.InputStream;
import java.io.OutputStream;
import java.io.Serializable;

/**
 * XXTEA（Corrected Block Tiny Encryption Algorithm）算法实现

 * 来自：https://github.com/xxtea/xxtea-java
 *
 * @author Ma Bingyao
 */
public class XXTEA implements SymmetricEncryptor, SymmetricDecryptor, Serializable {
	private static final long serialVersionUID = 1L;

	private static final int DELTA = 0x9E3779B9;

	private final byte[] key;

	/**
	 * 构造
	 *
	 * @param key 密钥，16位
	 */
	public XXTEA(byte[] key) {
		this.key = key;
	}

	@Override
	public byte[] encrypt(byte[] data) {
		if (data.length == 0) {
			return data;
		}
		return toByteArray(encrypt(
				toIntArray(data, true),
				toIntArray(fixKey(key), false)), false);
	}

	@Override
	public void encrypt(InputStream data, OutputStream out, boolean isClose) {
		IoUtil.write(out, isClose, encrypt(IoUtil.readBytes(data)));
	}

	@Override
	public byte[] decrypt(byte[] data) {
		if (data.length == 0) {
			return data;
		}
		return toByteArray(decrypt(
				toIntArray(data, false),
				toIntArray(fixKey(key), false)), true);
	}

	@Override
	public void decrypt(InputStream data, OutputStream out, boolean isClose) {
		IoUtil.write(out, isClose, decrypt(IoUtil.readBytes(data)));
	}

	//region Private Method
	private static int[] encrypt(int[] v, int[] k) {
		int n = v.length - 1;

		if (n < 1) {
			return v;
		}
		int p, q = 6 + 52 / (n + 1);
		int z = v[n], y, sum = 0, e;

		while (q-- > 0) {
			sum = sum + DELTA;
			e = sum >>> 2 & 3;
			for (p = 0; p < n; p++) {
				y = v[p + 1];
				z = v[p] += mx(sum, y, z, p, e, k);
			}
			y = v[0];
			z = v[n] += mx(sum, y, z, p, e, k);
		}
		return v;
	}

	private static int[] decrypt(int[] v, int[] k) {
		int n = v.length - 1;

		if (n < 1) {
			return v;
		}
		int p, q = 6 + 52 / (n + 1);
		int z, y = v[0], sum = q * DELTA, e;

		while (sum != 0) {
			e = sum >>> 2 & 3;
			for (p = n; p > 0; p--) {
				z = v[p - 1];
				y = v[p] -= mx(sum, y, z, p, e, k);
			}
			z = v[n];
			y = v[0] -= mx(sum, y, z, p, e, k);
			sum = sum - DELTA;
		}
		return v;
	}

	private static int mx(int sum, int y, int z, int p, int e, int[] k) {
		return (z >>> 5 ^ y << 2) + (y >>> 3 ^ z << 4) ^ (sum ^ y) + (k[p & 3 ^ e] ^ z);
	}

	private static byte[] fixKey(byte[] key) {
		if (key.length == 16) {
			return key;
		}
		byte[] fixedkey = new byte[16];
		System.arraycopy(key, 0, fixedkey, 0, Math.min(key.length, 16));
		return fixedkey;
	}

	private static int[] toIntArray(byte[] data, boolean includeLength) {
		int n = (((data.length & 3) == 0)
				? (data.length >>> 2)
				: ((data.length >>> 2) + 1));
		int[] result;

		if (includeLength) {
			result = new int[n + 1];
			result[n] = data.length;
		} else {
			result = new int[n];
		}
		n = data.length;
		for (int i = 0; i < n; ++i) {
			result[i >>> 2] |= (0x000000ff & data[i]) << ((i & 3) << 3);
		}
		return result;
	}

	private static byte[] toByteArray(int[] data, boolean includeLength) {
		int n = data.length << 2;

		if (includeLength) {
			int m = data[data.length - 1];
			n -= 4;
			if ((m < n - 3) || (m > n)) {
				return null;
			}
			n = m;
		}
		byte[] result = new byte[n];

		for (int i = 0; i < n; ++i) {
			result[i] = (byte) (data[i >>> 2] >>> ((i & 3) << 3));
		}
		return result;
	}
	//endregion
}