java后端密码解密_java前后端密码加密

这是一个关于Java后端使用RSA算法进行密码加密和解密的工具类。该类提供了生成密钥对、公钥加密、私钥解密的方法,并且支持从模和指数生成公钥和私钥。
摘要由CSDN通过智能技术生成

packagecom.common.utils;importjavax.crypto.Cipher;importjava.io.ByteArrayOutputStream;importjava.math.BigInteger;importjava.security.KeyFactory;importjava.security.KeyPair;importjava.security.KeyPairGenerator;importjava.security.NoSuchAlgorithmException;importjava.security.interfaces.RSAPrivateKey;importjava.security.interfaces.RSAPublicKey;importjava.security.spec.RSAPrivateKeySpec;importjava.security.spec.RSAPublicKeySpec;importjava.util.HashMap;importjava.util.Map;/*** RSA 工具类。提供加密,解密,生成密钥对等方法。

* 需要到 下载bcprov-jdk14-123.jar。

**/

public classRSAUtils {private static final int MAX_ENCRYPT_BLOCK = 117; //RSA最大加密明文大小

private static final int MAX_DECRYPT_BLOCK = 128; //RSA最大解密密文大小

/*** 生成公钥和私钥

*

*@throwsNoSuchAlgorithmException*/

public static KeyPair genRSAKeyPair() throwsNoSuchAlgorithmException {

KeyPairGenerator keyPairGen= KeyPairGenerator.getInstance("RSA");

keyPairGen.initialize(1024);returnkeyPairGen.generateKeyPair();

}/*** 使用模和指数生成RSA公钥

* 注意:【此代码用了默认补位方式,为RSA/None/PKCS1Padding,不同JDK默认的补位方式可能不同,如Android默认是RSA

* /None/NoPadding】

*

*@parammodulus 模

*@paramexponent 指数

*@return

*/

public staticRSAPublicKey getPublicKey(String modulus, String exponent) {try{

BigInteger b1= new BigInteger(modulus, 16);

BigInteger b2= new BigInteger(exponent, 16);

KeyFactory keyFactory= KeyFactory.getInstance("RSA");

RSAPublicKeySpec keySpec= newRSAPublicKeySpec(b1, b2);return(RSAPublicKey) keyFactory.generatePublic(keySpec);

}catch(Exception e) {

e.printStackTrace();return null;

}

}/*** 使用模和指数生成RSA私钥

* 注意:【此代码用了默认补位方式,为RSA/None/PKCS1Padding,不同JDK默认的补位方式可能不同,如Android默认是RSA

* /None/NoPadding】

*

*@parammodulus 模

*@paramexponent 指数

*@return

*/

public staticRSAPrivateKey getPrivateKey(String modulus, String exponent) {try{

BigInteger b1= new BigInteger(modulus, 16);

BigInteger b2= new BigInteger(exponent, 16);

KeyFactory keyFactory= KeyFactory.getInstance("RSA");

RSAPrivateKeySpec keySpec= newRSAPrivateKeySpec(b1, b2);return(RSAPrivateKey) keyFactory.generatePrivate(keySpec);

}catch(Exception e) {

e.printStackTrace();return null;

}

}/*** 公钥加密*/

public static byte[] encryptByPublicKey(byte[] data, RSAPublicKey publicKey) throwsException {

Cipher cipher= Cipher.getInstance("RSA");

cipher.init(Cipher.ENCRYPT_MODE, publicKey);int inputLen =data.length;try (ByteArrayOutputStream out = newByteArrayOutputStream()) {int offSet = 0;byte[] cache;int i = 0;//对数据分段加密

while (inputLen - offSet > 0) {if (inputLen - offSet >MAX_ENCRYPT_BLOCK) {

cache=cipher.doFinal(data, offSet, MAX_ENCRYPT_BLOCK);

}else{

cache= cipher.doFinal(data, offSet, inputLen -offSet);

}

out.write(cache,0, cache.length);

i++;

offSet= i *MAX_ENCRYPT_BLOCK;

}returnout.toByteArray();

}

}/*** 私钥解密*/

public static String decryptByPrivateKey(byte[] encryptedData, RSAPrivateKey privateKey) throwsException {

Cipher cipher= Cipher.getInstance("RSA");

cipher.init(Cipher.DECRYPT_MODE, privateKey);int inputLen =encryptedData.length;try (ByteArrayOutputStream out = newByteArrayOutputStream()) {int offSet = 0;byte[] cache;int i = 0;//对数据分段解密

while (inputLen - offSet > 0) {if (inputLen - offSet >MAX_DECRYPT_BLOCK) {

cache=cipher.doFinal(encryptedData, offSet, MAX_DECRYPT_BLOCK);

}else{

cache= cipher.doFinal(encryptedData, offSet, inputLen -offSet);

}

out.write(cache,0, cache.length);

i++;

offSet= i *MAX_DECRYPT_BLOCK;

}return new String(out.toByteArray(), "utf-8");

}

}/*** ASCII码转BCD码*/

public static byte[] ASCII_To_BCD(byte[] ascii, intasc_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));

}returnbcd;

}public static byte asc_to_bcd(byteasc) {bytebcd;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);elsebcd= (byte) (asc - 48);returnbcd;

}/*** 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 newString(temp);

}/*** 拆分字符串*/

public static String[] splitString(String string, intlen) {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;

}returnstrings;

}/*** 拆分数组*/

public static byte[][] splitArray(byte[] data, intlen) {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;

}returnarrays;

}//String 解密

public static String Decrypt(String str,String mou,String m) throwsException{//模hex

String modulus =mou;//私钥指数hex

String private_exponent =m;

RSAPrivateKey priKey=getPrivateKey(modulus, private_exponent);returndecryptByPrivateKey(HexUtil.hexStringToBytes(str), priKey);

}//获取模块信息

public static Map getModulus () throwsNoSuchAlgorithmException{

KeyPair keyPair=genRSAKeyPair();

Map map= newHashMap();//生成公钥和私钥

RSAPublicKey publicKey =(RSAPublicKey) keyPair.getPublic();

RSAPrivateKey privateKey=(RSAPrivateKey) keyPair.getPrivate();//模hex

String modulus = publicKey.getModulus().toString(16);//公钥指数hex

String public_exponent = publicKey.getPublicExponent().toString(16);//私钥指数hex

String private_exponent = privateKey.getPrivateExponent().toString(16);

map.put("g", public_exponent);

map.put("m", private_exponent);

map.put("modu", modulus);returnmap;

}public static void main(String[] args) throwsException {

KeyPair keyPair=genRSAKeyPair();//生成公钥和私钥

RSAPublicKey publicKey =(RSAPublicKey) keyPair.getPublic();

RSAPrivateKey privateKey=(RSAPrivateKey) keyPair.getPrivate();//模hex

String modulus = publicKey.getModulus().toString(16);//公钥指数hex

String public_exponent = publicKey.getPublicExponent().toString(16);//私钥指数hex

String private_exponent = privateKey.getPrivateExponent().toString(16);

System.out.println("public_modulus: " +modulus);

System.out.println("public_exponent: " +public_exponent);

System.out.println("private_exponent: " +private_exponent);//明文

String plaintStr = "123456";

System.out.println("plaintStr: " +plaintStr);//使用模和指数生成公钥和私钥

RSAPublicKey pubKey =getPublicKey(modulus, public_exponent);

RSAPrivateKey priKey=getPrivateKey(modulus, private_exponent);//公钥加密后的密文

byte[] encryptStr = encryptByPublicKey(plaintStr.getBytes("utf-8"), pubKey);

System.out.println("encryptStr: " +HexUtil.bytesToHexString(encryptStr));

String jmh=HexUtil.bytesToHexString(encryptStr);

System.out.println("start");//私钥解密后的明文

System.out.println("decryptStr: " +decryptByPrivateKey(HexUtil.hexStringToBytes(jmh), priKey));

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值