基于改进RSA算法的隐私数据集同态加密方法

Homomorphic encryption of privacy data set based on improved RSA algorithm

摘要:

为提高对数据集的加密效果和保障数据集的安全性，在分析传统非对称密钥(RSA)算法运行原理及其参数选择、素数判定条件的基础上，提出了改进RSA算法。为进一步提升加密速度，引入数据加密(DES)算法。首先利用DES算法实现明文数据集的加密，并针对密钥进行RSA加密；在此基础上，在明文和密文空间中，利用加法同态过程对密文进行计算，并通过对结果的解密操作得到相应的明文计算结果。实验结果表明，与基于传统RSA算法或DES算法的加密方法相比，该方法的加密效率和抵御攻击成功率更高，加密过程耗时5~6 s，抵御攻击成功率保持在95%上下，说明该方法能够有效保护隐私数据集的安全。

Abstract:

In order to improve the encryption effect and ensure the security of the data set, this study designs a privacy data set homomorphic encryption method based on the improved Rivest Shamir Adleman(RSA) algorithm. Based on the analysis of the operating principle of traditional RSA algorithm, the parameter selection and the prime number judgment condition, the improved RSA algorithm is proposed. In order to further improve the encryption speed, Data Encryption Standard(DES) algorithm is introduced. Firstly, DES algorithm is utilized to encrypt the plaintext data set, and RSA encryption is carried out for the key. On this basis, in the plaintext and ciphertext spaces, the addition homomorphism process is adopted to calculate the ciphertext, and the corresponding plaintext calculation result is obtained by decrypting the result. Experimental results show that, compared with the encryption method based on traditional RSA algorithm or DES algorithm, this method has higher encryption efficiency and higher success rate of resisting attacks. The encryption process takes time between 5 and 6 s, and the success rate of resisting attacks is kept around 95%, indicating that this method can effectively provide support for the security protection of private data sets.