rsautils java,RSAUtils.java

package com.study.util.rsa;

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;

/**

* 文件描述:明文传输加密类

*

* @author dzz

* @since 1.1.0

*/

public class RSAUtils {

/**

* 方法描述: 生成公钥和私钥

* 完成时间: 2018年9月1日 下午5:30:56

* 作者: dzz

*

* @return

* @throws NoSuchAlgorithmException

*/

public static HashMap getKeys() throws NoSuchAlgorithmException {

Security.addProvider(new org.bouncycastle.jce.provider.BouncyCastleProvider());

HashMap map = new HashMap();

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公钥

* 完成时间: 2018年9月1日 下午5:31:07

* 作者: dzz

*

* @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私钥

* 完成时间: 2018年9月1日 下午5:31:21

* 作者: dzz

*

* @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;

}

}

/**

* 方法描述: 公钥加密

* 完成时间: 2018年9月1日 下午5:31:29

* 作者: dzz

*

* @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;

}

/**

* 方法描述: 私钥解密

* 完成时间: 2018年9月1日 下午5:31:35

* 作者: dzz

*

* @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 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 = "Aa111111";

// 使用模和指数生成公钥和私钥

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);

}

}

一键复制

编辑

Web IDE

原始数据

按行查看

历史

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值