rsa 加密

下面有rsa.js 的压缩包

public class RsaResponse {
    public int code;
    public String publicKeyExponent;
    public String publicKeyModulus;
}
import java.math.BigInteger;
import java.security.KeyFactory;
import java.security.KeyPair;
import java.security.KeyPairGenerator;
import java.security.NoSuchAlgorithmException;
import java.security.Security;
import java.security.interfaces.RSAPrivateKey;
import java.security.interfaces.RSAPublicKey;
import java.security.spec.RSAPrivateKeySpec;
import java.security.spec.RSAPublicKeySpec;
import java.util.HashMap;

import javax.crypto.Cipher;

public class RSAUtils
{
	/**
	 * 生成公钥和私钥
	 * 
	 * @throws NoSuchAlgorithmException
	 * 
	 */
	public static HashMap<String, Object> getKeys() throws NoSuchAlgorithmException
	{
		Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());
		HashMap<String, Object> map = new HashMap<String, Object>();
		KeyPairGenerator keyPairGen = KeyPairGenerator.getInstance("RSA",
				new org.bouncycastle.jce.provider.BouncyCastleProvider());
		keyPairGen.initialize(1024);
		KeyPair keyPair = keyPairGen.generateKeyPair();
		RSAPublicKey publicKey = (RSAPublicKey) keyPair.getPublic();
		RSAPrivateKey privateKey = (RSAPrivateKey) keyPair.getPrivate();
		map.put("public", publicKey);
		map.put("private", privateKey);
		return map;
	}

	/**
	 * 使用模和指数生成RSA公钥
	 * 
	 * @param modulus
	 *            模
	 * @param exponent
	 *            指数
	 * @return
	 */
	public static RSAPublicKey getPublicKey(String modulus, String exponent)
	{
		Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());
		try
		{
			BigInteger b1 = new BigInteger(modulus);
			BigInteger b2 = new BigInteger(exponent);
			KeyFactory keyFactory = KeyFactory.getInstance("RSA",
					new org.bouncycastle.jce.provider.BouncyCastleProvider());
			RSAPublicKeySpec keySpec = new RSAPublicKeySpec(b1, b2);
			return (RSAPublicKey) keyFactory.generatePublic(keySpec);
		}
		catch (Exception e)
		{
			e.printStackTrace();
			return null;
		}
	}

	/**
	 * 使用模和指数生成RSA私钥 /None/NoPadding
	 * 
	 * @param modulus
	 *            模
	 * @param exponent
	 *            指数
	 * @return
	 */
	public static RSAPrivateKey getPrivateKey(String modulus, String exponent)
	{
		try
		{
			Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());
			BigInteger b1 = new BigInteger(modulus);
			BigInteger b2 = new BigInteger(exponent);
			KeyFactory keyFactory = KeyFactory.getInstance("RSA",
					new org.bouncycastle.jce.provider.BouncyCastleProvider());
			RSAPrivateKeySpec keySpec = new RSAPrivateKeySpec(b1, b2);
			return (RSAPrivateKey) keyFactory.generatePrivate(keySpec);
		}
		catch (Exception e)
		{
			e.printStackTrace();
			return null;
		}
	}

	/**
	 * 公钥加密
	 * 
	 * @param data
	 * @param publicKey
	 * @return
	 * @throws Exception
	 */
	public static String encryptByPublicKey(String data, RSAPublicKey publicKey) throws Exception
	{
		Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());
		Cipher cipher = Cipher.getInstance("RSA", new org.bouncycastle.jce.provider.BouncyCastleProvider());
		cipher.init(Cipher.ENCRYPT_MODE, publicKey);
		// 模长
		int key_len = publicKey.getModulus().bitLength() / 8;
		// 加密数据长度 <= 模长-11
		String[] datas = splitString(data, key_len - 11);
		String mi = "";
		// 如果明文长度大于模长-11则要分组加密
		for (String s : datas)
		{
			mi += bcd2Str(cipher.doFinal(s.getBytes()));
		}
		return mi;
	}

	/**
	 * 私钥解密
	 * 
	 * @param data
	 * @param privateKey
	 * @return
	 * @throws Exception
	 */
	public static String decryptByPrivateKey(String data, RSAPrivateKey privateKey) throws Exception
	{
		Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());
		Cipher cipher = Cipher.getInstance("RSA", new org.bouncycastle.jce.provider.BouncyCastleProvider());
		cipher.init(Cipher.DECRYPT_MODE, privateKey);
		// 模长
		int key_len = privateKey.getModulus().bitLength() / 8;
		byte[] bytes = data.getBytes();
		byte[] bcd = ASCII_To_BCD(bytes, bytes.length);
		// System.err.println(bcd.length);
		// 如果密文长度大于模长则要分组解密
		String ming = "";
		byte[][] arrays = splitArray(bcd, key_len);
		for (byte[] arr : arrays)
		{
			ming += new String(cipher.doFinal(arr));
		}
		return ming;
	}

	/**
	 * ASCII码转BCD码
	 * 
	 */
	public static byte[] ASCII_To_BCD(byte[] ascii, int asc_len)
	{
		byte[] bcd = new byte[asc_len / 2];
		int j = 0;
		for (int i = 0; i < (asc_len + 1) / 2; i++)
		{
			bcd[i] = asc_to_bcd(ascii[j++]);
			bcd[i] = (byte) (((j >= asc_len) ? 0x00 : asc_to_bcd(ascii[j++])) + (bcd[i] << 4));
		}
		return bcd;
	}

	public static byte asc_to_bcd(byte asc)
	{
		byte bcd;

		if ((asc >= '0') && (asc <= '9'))
			bcd = (byte) (asc - '0');
		else if ((asc >= 'A') && (asc <= 'F'))
			bcd = (byte) (asc - 'A' + 10);
		else if ((asc >= 'a') && (asc <= 'f'))
			bcd = (byte) (asc - 'a' + 10);
		else
			bcd = (byte) (asc - 48);
		return bcd;
	}

	/**
	 * BCD转字符串
	 */
	public static String bcd2Str(byte[] bytes)
	{
		char temp[] = new char[bytes.length * 2], val;

		for (int i = 0; i < bytes.length; i++)
		{
			val = (char) (((bytes[i] & 0xf0) >> 4) & 0x0f);
			temp[i * 2] = (char) (val > 9 ? val + 'A' - 10 : val + '0');

			val = (char) (bytes[i] & 0x0f);
			temp[i * 2 + 1] = (char) (val > 9 ? val + 'A' - 10 : val + '0');
		}
		return new String(temp);
	}

	/**
	 * 拆分字符串
	 */
	public static String[] splitString(String string, int len)
	{
		int x = string.length() / len;
		int y = string.length() % len;
		int z = 0;
		if (y != 0)
		{
			z = 1;
		}
		String[] strings = new String[x + z];
		String str = "";
		for (int i = 0; i < x + z; i++)
		{
			if (i == x + z - 1 && y != 0)
			{
				str = string.substring(i * len, i * len + y);
			}
			else
			{
				str = string.substring(i * len, i * len + len);
			}
			strings[i] = str;
		}
		return strings;
	}

	/**
	 *拆分数组
	 */
	public static byte[][] splitArray(byte[] data, int len)
	{
		int x = data.length / len;
		int y = data.length % len;
		int z = 0;
		if (y != 0)
		{
			z = 1;
		}
		byte[][] arrays = new byte[x + z][];
		byte[] arr;
		for (int i = 0; i < x + z; i++)
		{
			arr = new byte[len];
			if (i == x + z - 1 && y != 0)
			{
				System.arraycopy(data, i * len, arr, 0, y);
			}
			else
			{
				System.arraycopy(data, i * len, arr, 0, len);
			}
			arrays[i] = arr;
		}
		return arrays;
	}
	// public static void main(String[] args) throws Exception{
	// HashMap<String, Object> map = getKeys();
	// //生成公钥和私钥
	// RSAPublicKey publicKey = (RSAPublicKey) map.get("public");
	// RSAPrivateKey privateKey = (RSAPrivateKey) map.get("private");
	//          
	// //模
	// String modulus = publicKey.getModulus().toString();
	// System.out.println("pubkey modulus="+modulus);
	// //公钥指数
	// String public_exponent = publicKey.getPublicExponent().toString();
	// System.out.println("pubkey exponent="+public_exponent);
	// //私钥指数
	// String private_exponent = privateKey.getPrivateExponent().toString();
	// System.out.println("private exponent="+private_exponent);
	// //明文
	// String ming = "111";
	// //使用模和指数生成公钥和私钥
	// RSAPublicKey pubKey = RSAUtils.getPublicKey(modulus, public_exponent);
	// RSAPrivateKey priKey = RSAUtils.getPrivateKey(modulus, private_exponent);
	// //加密后的密文
	// String mi = RSAUtils.encryptByPublicKey(ming, pubKey);
	// System.err.println("mi="+mi);
	// //解密后的明文
	// String ming2 = RSAUtils.decryptByPrivateKey(mi, priKey);
	// System.err.println("ming2="+ming2);
	// }
}
//获取密钥
/**
 * 对str做RSA加密,密钥是key,返回加密好的字符串
 */
function encrypPassword(str, key){
	str = str.split("").reverse().join("");
	var encrypedPwd = RSAUtils.encryptedString(key, str);
	return encrypedPwd;
}
/*<%-- //'<%=request.getContextPath()%>/user/rsaKey.action' --%>
*/   
function rsaKey(element) {  
	$.ajax({
	    cache: true,
	    type: "get",
	    url:'/FusionAbility/user/rsaKey.action', 
	    dataType: "json",
	    async: false,
	    error: function(data) {
	        alert("请刷新页面后重新登录");
	    },
	    success: function(data) {
	    	RSAUtils.setMaxDigits(200);
	    	key = new RSAUtils.getKeyPair(data.publicKeyExponent, "", data.publicKeyModulus);
	    	console.log(element.val());
	    	element.val(encrypPassword(element.val(), key));
	    	console.log(element.val());
	    }
	});    
}
	public void rsaKey() {
		RsaResponse rsaRsp = new RsaResponse();
		Map map;
		try {
			map = RSAUtils.getKeys();
			RSAPublicKey publicKey = (RSAPublicKey) map.get("public");
			RSAPrivateKey privateKey = (RSAPrivateKey) map.get("private");
			getRequest().getSession().setAttribute("privateKey", privateKey);
			rsaRsp.publicKeyExponent = publicKey.getPublicExponent().toString(
					16);
			rsaRsp.publicKeyModulus = publicKey.getModulus().toString(16);
			rsaRsp.code = 200;
			getResponse().getWriter().write(JSONArray.toJSONString(rsaRsp));
		} catch (Exception e) {
			logger.info("", e);
			e.printStackTrace();
			rsaRsp.code = 0;
		}
		//getRequest().setAttribute("rsaRsp", rsaRsp);	
		
	}
//RSA解密
		String password=user.getUserpswd();
		RSAPrivateKey privateKey = (RSAPrivateKey)getRequest().getSession().getAttribute("privateKey");
		if(privateKey!=null){
			password = RSAUtils.decryptByPrivateKey(password, privateKey);  
			user.setUserpswd(password);
		}else{
			return "index";
		}
			
function loginSubmit(){
	var ele = $("#userpswd");
	rsaKey(ele);
	
	  $.ajax({
   cache: true,
   type: "POST",
   url:'<%=request.getContextPath()%>/user/login

捐助开发者

在兴趣的驱动下,写一个免费的东西,有欣喜,也还有汗水,希望你喜欢我的作品,同时也能支持一下。 当然,有钱捧个钱场(右上角的爱心标志,支持支付宝和PayPal捐助),没钱捧个人场,谢谢各位。



 
 
 谢谢您的赞助,我会做的更好!

猜你喜欢

转载自knight-black-bob.iteye.com/blog/2321861