SM2公钥加密Java代码示例

最新推荐文章于 2024-09-03 23:15:00 发布

kingsnow99

最新推荐文章于 2024-09-03 23:15:00 发布

阅读量2.8w

点赞数 3

文章标签：国密算法 SM2 Java 加密

本文链接：https://blog.csdn.net/kingsnow99/article/details/44675887

版权

本文展示了如何使用Java实现国密算法SM2的公钥加密过程，包括生成随机数、椭圆曲线点运算、KDF函数、密文组装和解密验证等关键步骤。

摘要由CSDN通过智能技术生成

最近研究了一下国密算法SM2中的公钥加密部分，用Java写了一个简单的例子。

/*文件：SM2.java*/

import java.math.BigInteger;

import java.security.SecureRandom;
import java.util.Arrays;

import org.bouncycastle.math.ec.ECCurve;
import org.bouncycastle.math.ec.ECPoint;

import org.bouncycastle.crypto.DerivationFunction;
import org.bouncycastle.crypto.digests.ShortenedDigest;

import org.bouncycastle.crypto.digests.SHA256Digest;
import org.bouncycastle.crypto.generators.KDF1BytesGenerator;
import org.bouncycastle.crypto.params.ISO18033KDFParameters;

public class SM02 {

private static BigInteger n = new BigInteger("FFFFFFFE" + "FFFFFFFF"
+ "FFFFFFFF" + "FFFFFFFF" + "7203DF6B" + "21C6052B" + "53BBF409"
+ "39D54123", 16);
private static BigInteger p = new BigInteger("FFFFFFFE" + "FFFFFFFF"
+ "FFFFFFFF" + "FFFFFFFF" + "FFFFFFFF" + "00000000" + "FFFFFFFF"
+ "FFFFFFFF", 16);
private static BigInteger a = new BigInteger("FFFFFFFE" + "FFFFFFFF"
+ "FFFFFFFF" + "FFFFFFFF" + "FFFFFFFF" + "00000000" + "FFFFFFFF"
+ "FFFFFFFC", 16);
private static BigInteger b = new BigInteger("28E9FA9E" + "9D9F5E34"
+ "4D5A9E4B" + "CF6509A7" + "F39789F5" + "15AB8F92" + "DDBCBD41"
+ "4D940E93", 16);
private static BigInteger gx = new BigInteger("32C4AE2C" + "1F198119"
+ "5F990446" + "6A39C994" + "8FE30BBF" + "F2660BE1" + "715A4589"
+ "334C74C7", 16);
private static BigInteger gy = new BigInteger("BC3736A2" + "F4F6779C"
+ "59BDCEE3" + "6B692153" + "D0A9877C" + "C62A4740" + "02DF32E5"
+ "2139F0A0", 16);

private static SecureRandom random = new SecureRandom();
private ECCurve.Fp curve;
private ECPoint G;

public static void printHexString(byte[] b) {
for (int i = 0; i < b.length; i++) {
String hex = Integer.toHexString(b[i] & 0xFF);
if (hex.length() == 1) {
hex = '0' + hex;
}
System.out.print(hex.toUpperCase());
}