mirror of
https://gitee.com/dromara/hutool.git
synced 2025-04-05 17:37:59 +08:00
remove Paillier
This commit is contained in:
parent
c84f674c1e
commit
cdba0162f8
@ -9,7 +9,6 @@
|
||||
* 【poi 】 添加系列方法writeCol,以支持按列输出(pr#1003@Gitee)
|
||||
* 【core 】 CollUtil新增anyMatch和allMatch方法(pr#1008@Gitee)
|
||||
* 【core 】 CsvWriter如果开启了append=true,默认自动开启endingLineBreak=true(pr#1010@Gitee)
|
||||
* 【crypto】 添加同态加密算法Paillier(pr#1010@Gitee)
|
||||
|
||||
### 🐞Bug修复
|
||||
* 【core 】 修复TreeUtil.getParentsName()获取到的路径集合中存在值为null的路径名称问题(issue#I795IN@Gitee)
|
||||
|
@ -1,206 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2023 looly(loolly@aliyun.com)
|
||||
* Hutool is licensed under Mulan PSL v2.
|
||||
* You can use this software according to the terms and conditions of the Mulan PSL v2.
|
||||
* You may obtain a copy of Mulan PSL v2 at:
|
||||
* http://license.coscl.org.cn/MulanPSL2
|
||||
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
|
||||
* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
|
||||
* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
|
||||
* See the Mulan PSL v2 for more details.
|
||||
*/
|
||||
|
||||
package cn.hutool.crypto.asymmetric.paillier;
|
||||
|
||||
import cn.hutool.core.util.HexUtil;
|
||||
|
||||
import java.math.BigInteger;
|
||||
import java.security.SecureRandom;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* 同态加密算法Paillier
|
||||
* <p>
|
||||
* 加法同态,存在有效算法+,E(x+y)=E(x)+E(y)或者 x+y=D(E(x)+E(y))成立,并且不泄漏 x 和 y。
|
||||
* 乘法同态,存在有效算法*,E(x×y)=E(x)*E(y)或者 xy=D(E(x)*E(y))成立,并且不泄漏 x 和 y。
|
||||
* <p>
|
||||
* 方案安全性可以归约到判定性合数剩余假设(Decisional Composite Residuosity Assumption, DCRA),即给定一个合数n和整数z,判定z是否在n^2下是否是n次剩余是困难的。
|
||||
* 这个假设经过了几十年的充分研究,到目前为止还没有多项式时间的算法可以攻破,所以Paillier加密方案的安全性被认为相当可靠。
|
||||
* <p>
|
||||
* 字符串文本加解密相互配对,此时无法使用同态加法和同态乘法
|
||||
* 数值类型不可使用字符串加解密
|
||||
* <p>
|
||||
* 公钥加密和同态加法/同态乘法运算
|
||||
* 私钥解密
|
||||
*
|
||||
* @author Revers.
|
||||
**/
|
||||
public class Paillier {
|
||||
|
||||
//公钥 n g
|
||||
//私钥 n lambda u
|
||||
private static final int bitLength = 2048;
|
||||
private static final int certainty = 256;
|
||||
|
||||
/**
|
||||
* 生成密钥算法。(默认)
|
||||
* @return PaillierKeyPair 公钥私钥对
|
||||
*/
|
||||
public static PaillierKeyPair generateKey() {
|
||||
return generateKey(bitLength,certainty);
|
||||
}
|
||||
|
||||
/**
|
||||
* 生成密钥算法
|
||||
*
|
||||
* @param bitLength 密钥位数
|
||||
* @param certainty 此构造函数的执行时间与此参数的值成比例。
|
||||
* @return PaillierKeyPair 公钥私钥对
|
||||
*/
|
||||
public static PaillierKeyPair generateKey(final int bitLength, final int certainty) {
|
||||
final BigInteger p =new BigInteger(bitLength / 2, certainty, new SecureRandom());
|
||||
final BigInteger q =new BigInteger(bitLength / 2, certainty, new SecureRandom());
|
||||
final BigInteger n = p.multiply(q);
|
||||
final BigInteger nSquare = n.multiply(n);
|
||||
final BigInteger lambda = p.subtract(BigInteger.ONE).multiply(q.subtract(BigInteger.ONE))
|
||||
.divide(p.subtract(BigInteger.ONE).gcd(q.subtract(BigInteger.ONE)));
|
||||
final BigInteger g = n.add(BigInteger.ONE);
|
||||
final BigInteger u = g.modPow(lambda, nSquare).subtract(BigInteger.ONE).divide(n).modInverse(n);
|
||||
final PaillierpublicKey publicKey = new PaillierpublicKey(n,g);
|
||||
final PaillierPrivateKey privateKey = new PaillierPrivateKey(n, lambda,u);
|
||||
return new PaillierKeyPair(publicKey,privateKey);
|
||||
}
|
||||
|
||||
/**
|
||||
* 字符串加密算法。输入一个明文和一个公钥
|
||||
* 只能使用字符串解密算法 decryptString ,不可使用同态加法和同态乘法
|
||||
*
|
||||
* @param text 明文,字符串形式
|
||||
* @param publicKey 公钥
|
||||
*
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] encryptString(final String text, final PaillierpublicKey publicKey) {
|
||||
final BigInteger r = new BigInteger(bitLength, new Random());
|
||||
final BigInteger n = publicKey.getN();
|
||||
final BigInteger nsquare = n.multiply(n);
|
||||
return publicKey.getG().modPow( new BigInteger(HexUtil.encodeHexStr(text),16), nsquare).multiply(r.modPow(n, nsquare)).mod(nsquare).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 字符串解密算法。输入一个密文和一个私钥
|
||||
*
|
||||
* @param ciphertext byte[]密文
|
||||
* @param privateKey 私钥
|
||||
* @return 解密的明文
|
||||
*/
|
||||
public static String decryptString(final byte[] ciphertext, final PaillierPrivateKey privateKey) {
|
||||
final BigInteger n = privateKey.getN();
|
||||
final BigInteger lambda = privateKey.getLambda();
|
||||
final BigInteger u = privateKey.getu();
|
||||
final BigInteger nsquare = n.multiply(n);
|
||||
final String s = new BigInteger(ciphertext).modPow(lambda, nsquare).subtract(BigInteger.ONE).divide(n).multiply(u).mod(n).toString();
|
||||
return HexUtil.decodeHexStr(new BigInteger(s).toString(16));
|
||||
}
|
||||
|
||||
/**
|
||||
* 加密算法。输入一个明文和一个公钥
|
||||
*
|
||||
* @param text 明文,为防止字符串数据,只能使用 BigInteger类型
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] encrypt(final BigInteger text, final PaillierpublicKey publicKey) {
|
||||
final BigInteger r = new BigInteger(bitLength, new Random());
|
||||
final BigInteger n = publicKey.getN();
|
||||
final BigInteger nsquare = n.multiply(n);
|
||||
return publicKey.getG().modPow(text, nsquare).multiply(r.modPow(n, nsquare)).mod(nsquare).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 解密算法。输入一个密文和一个私钥
|
||||
*
|
||||
* @param ciphertext byte[]密文
|
||||
* @param privateKey 私钥
|
||||
* @return 解密的明文
|
||||
*/
|
||||
public static String decrypt(final byte[] ciphertext, final PaillierPrivateKey privateKey) {
|
||||
final BigInteger n = privateKey.getN();
|
||||
final BigInteger lambda = privateKey.getLambda();
|
||||
final BigInteger u = privateKey.getu();
|
||||
final BigInteger nsquare = n.multiply(n);
|
||||
return new BigInteger(ciphertext).modPow(lambda, nsquare).subtract(BigInteger.ONE).divide(n).multiply(u).mod(n).toString();
|
||||
}
|
||||
|
||||
/**
|
||||
* 同态标量加算法。输入两个密文和一个公钥
|
||||
*
|
||||
* @param ciphertext 密文1,BigInteger
|
||||
* @param ciphertext2 密文2,BigInteger
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] add(final BigInteger ciphertext, final BigInteger ciphertext2, final PaillierpublicKey publicKey){
|
||||
return ciphertext.add(ciphertext2).multiply(publicKey.getN()).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 同态标量加算法。输入两个密文和一个公钥
|
||||
*
|
||||
* @param ciphertext 密文1,10进制字符串
|
||||
* @param ciphertext2 密文2,10进制字符串
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] add(final String ciphertext, final String ciphertext2, final PaillierpublicKey publicKey){
|
||||
return new BigInteger(ciphertext).multiply(new BigInteger(ciphertext2)).mod(publicKey.getN().multiply(publicKey.getN())).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 同态标量加算法。输入两个密文和一个公钥
|
||||
*
|
||||
* @param ciphertext byte[] 10进制字符串
|
||||
* @param ciphertext2 byte[] 10进制字符串
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] add(final byte[] ciphertext, final byte[] ciphertext2, final PaillierpublicKey publicKey){
|
||||
return new BigInteger(ciphertext).multiply(new BigInteger(ciphertext2)).mod(publicKey.getN().multiply(publicKey.getN())).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 同态标量乘算法。输入一个密文和一个标量明文和一个公钥
|
||||
*
|
||||
* @param ciphertext 密文,BigInteger
|
||||
* @param number 明文,10进制字符串
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] multiply(final BigInteger ciphertext, final BigInteger number, final PaillierpublicKey publicKey){
|
||||
return ciphertext.modPow(number,publicKey.getN().multiply(publicKey.getN())).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 同态标量乘算法。输入一个密文和一个标量明文和一个公钥
|
||||
*
|
||||
* @param ciphertext 密文,byte[]
|
||||
* @param number 明文,10进制字符串
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] multiply(final String ciphertext, final BigInteger number, final PaillierpublicKey publicKey){
|
||||
return new BigInteger(ciphertext).modPow(number,publicKey.getN().multiply(publicKey.getN())).toByteArray();
|
||||
}
|
||||
|
||||
/**
|
||||
* 同态标量乘算法。输入一个密文和一个标量明文和一个公钥
|
||||
*
|
||||
* @param ciphertext 密文,byte[]
|
||||
* @param number 明文,10进制字符串
|
||||
* @param publicKey 公钥
|
||||
* @return byte[]密文
|
||||
*/
|
||||
public static byte[] multiply(final byte[] ciphertext, final BigInteger number, final PaillierpublicKey publicKey){
|
||||
return new BigInteger(ciphertext).modPow(number,publicKey.getN().multiply(publicKey.getN())).toByteArray();
|
||||
}
|
||||
}
|
@ -1,44 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2023 looly(loolly@aliyun.com)
|
||||
* Hutool is licensed under Mulan PSL v2.
|
||||
* You can use this software according to the terms and conditions of the Mulan PSL v2.
|
||||
* You may obtain a copy of Mulan PSL v2 at:
|
||||
* http://license.coscl.org.cn/MulanPSL2
|
||||
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
|
||||
* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
|
||||
* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
|
||||
* See the Mulan PSL v2 for more details.
|
||||
*/
|
||||
|
||||
package cn.hutool.crypto.asymmetric.paillier;
|
||||
|
||||
/**
|
||||
* 存放Paillier 公钥私钥对
|
||||
*
|
||||
* @author Revers.
|
||||
**/
|
||||
public class PaillierKeyPair {
|
||||
private PaillierPrivateKey privateKey;
|
||||
private PaillierpublicKey publicKey;
|
||||
|
||||
public PaillierKeyPair(PaillierpublicKey PaillierpublicKey,PaillierPrivateKey PaillierPrivateKey) {
|
||||
this.privateKey = PaillierPrivateKey;
|
||||
this.publicKey = PaillierpublicKey;
|
||||
}
|
||||
|
||||
public PaillierPrivateKey getPrivateKey() {
|
||||
return privateKey;
|
||||
}
|
||||
|
||||
public void setPrivateKey(PaillierPrivateKey privateKey) {
|
||||
this.privateKey = privateKey;
|
||||
}
|
||||
|
||||
public PaillierpublicKey getPublicKey() {
|
||||
return publicKey;
|
||||
}
|
||||
|
||||
public void setPublicKey(PaillierpublicKey publicKey) {
|
||||
this.publicKey = publicKey;
|
||||
}
|
||||
}
|
@ -1,51 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2023 looly(loolly@aliyun.com)
|
||||
* Hutool is licensed under Mulan PSL v2.
|
||||
* You can use this software according to the terms and conditions of the Mulan PSL v2.
|
||||
* You may obtain a copy of Mulan PSL v2 at:
|
||||
* http://license.coscl.org.cn/MulanPSL2
|
||||
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
|
||||
* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
|
||||
* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
|
||||
* See the Mulan PSL v2 for more details.
|
||||
*/
|
||||
|
||||
package cn.hutool.crypto.asymmetric.paillier;
|
||||
|
||||
import java.math.BigInteger;
|
||||
|
||||
/** 存放Paillier 私钥
|
||||
*
|
||||
* @author Revers.
|
||||
**/
|
||||
public class PaillierPrivateKey{
|
||||
private final BigInteger n;
|
||||
private final BigInteger lambda;
|
||||
private final BigInteger u;
|
||||
|
||||
public PaillierPrivateKey(BigInteger n, BigInteger lambda, BigInteger u) {
|
||||
if (n == null) {
|
||||
throw new NullPointerException("n is null");
|
||||
}
|
||||
if (lambda == null) {
|
||||
throw new NullPointerException("lambda is null");
|
||||
}
|
||||
if (u == null) {
|
||||
throw new NullPointerException("u is null");
|
||||
}
|
||||
this.n = n;
|
||||
this.lambda = lambda;
|
||||
this.u = u;
|
||||
}
|
||||
|
||||
public BigInteger getN() {
|
||||
return n;
|
||||
}
|
||||
public BigInteger getLambda() {
|
||||
return lambda;
|
||||
}
|
||||
public BigInteger getu() {
|
||||
return u;
|
||||
}
|
||||
|
||||
}
|
@ -1,44 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2023 looly(loolly@aliyun.com)
|
||||
* Hutool is licensed under Mulan PSL v2.
|
||||
* You can use this software according to the terms and conditions of the Mulan PSL v2.
|
||||
* You may obtain a copy of Mulan PSL v2 at:
|
||||
* http://license.coscl.org.cn/MulanPSL2
|
||||
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
|
||||
* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
|
||||
* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
|
||||
* See the Mulan PSL v2 for more details.
|
||||
*/
|
||||
|
||||
package cn.hutool.crypto.asymmetric.paillier;
|
||||
|
||||
import java.math.BigInteger;
|
||||
|
||||
/**
|
||||
* 存放Paillier 公钥
|
||||
*
|
||||
* @author Revers.
|
||||
*/
|
||||
public class PaillierpublicKey {
|
||||
private BigInteger n;
|
||||
private BigInteger g;
|
||||
|
||||
public PaillierpublicKey(BigInteger n, BigInteger g) {
|
||||
if (n == null) {
|
||||
throw new NullPointerException("n is null");
|
||||
}
|
||||
if (g == null) {
|
||||
throw new NullPointerException("g is null");
|
||||
}
|
||||
this.n = n;
|
||||
this.g = g;
|
||||
}
|
||||
|
||||
public BigInteger getN() {
|
||||
return n;
|
||||
}
|
||||
|
||||
public BigInteger getG() {
|
||||
return g;
|
||||
}
|
||||
}
|
@ -1,18 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2023 looly(loolly@aliyun.com)
|
||||
* Hutool is licensed under Mulan PSL v2.
|
||||
* You can use this software according to the terms and conditions of the Mulan PSL v2.
|
||||
* You may obtain a copy of Mulan PSL v2 at:
|
||||
* http://license.coscl.org.cn/MulanPSL2
|
||||
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
|
||||
* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
|
||||
* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
|
||||
* See the Mulan PSL v2 for more details.
|
||||
*/
|
||||
|
||||
/**
|
||||
* 同态加密算法 Paillier
|
||||
*
|
||||
* @author Revers
|
||||
*/
|
||||
package cn.hutool.crypto.asymmetric.paillier;
|
Loading…
Reference in New Issue
Block a user