摘要
针对RSA公钥加密算法安全性高实用性强等特点,以及解密算法需要巨大的存储空间以及高额的计算成本的缺陷,提出了一种改进方案。该方案采用多素数原理,利用多个素数得出模数n,增加使用因子分解进行攻击的难度,同时采用中国剩余定理进行解密,在确保安全性的同时,提高RSA解密速度。结果表明,运算速度为原来的3.25倍,破解密码的困难度提高1.25倍。
According to the widely used and high safety of RSA public key encryption algorithm. And the defect thatthe decryption algorithm need huge storage space and high calculation cost on account of the high security. An improved adaptive .algorithm is proposed in this paper, which using the Multi-prime principle to get the modulus n, and increasing the difficulty of the factorization attack. At the same time using the Chinese remainder theorem to decrypt, which can improve the speed of RSA decryption and en- suring safety at the same time.The results show that the operation speed is 3.25 times compared with the original one. What's more, the difficity of cracking the code is increased 1.25 times.
出处
《电子设计工程》
2017年第20期83-85,89,共4页
Electronic Design Engineering
关键词
RSA
多素数原理
模数n
中国剩余定理
RSA
multi-prime principle
modulus n
Chinese remainder theorem