Bunder等人于2016年提出了利用连分式方法求解模方程中未知变量的问题,并将该问题扩展到对三种RSA变型方案的安全性分析.该模方程的表达式为ed≡1 mod (p^2-1)(q^2-1),其中N=pq为RSA模数,且p和q的规模是任意的, e和d分别为方案的公钥和...Bunder等人于2016年提出了利用连分式方法求解模方程中未知变量的问题,并将该问题扩展到对三种RSA变型方案的安全性分析.该模方程的表达式为ed≡1 mod (p^2-1)(q^2-1),其中N=pq为RSA模数,且p和q的规模是任意的, e和d分别为方案的公钥和私钥.类似于RSA方案的小解密指数分析, Bunder等人给出了基于上述模方程的相关小解密指数分析结果.本文利用Coppersmith方法大幅度改进了Bunder等人的分析结果,扩大了可以实现的上述三种变型RSA方案小解密指数攻击的参数范围.对于上述模方程中的未知变量的求解,我们在构造格时,通过添加额外的参数使得p和q在不同规模下,尽可能优化格的构造,提升了之前的结果.最后,通过实验验证了我们的方法.展开更多
A proactive threshold signature scheme is very important to tolerate mobile attack in mobile ad hoc networks. In this paper, we propose an efficient proactive threshold RSA signature scheme for ad hoc networks. The sc...A proactive threshold signature scheme is very important to tolerate mobile attack in mobile ad hoc networks. In this paper, we propose an efficient proactive threshold RSA signature scheme for ad hoc networks. The scheme consists of three protocols: the initial secret share distribution protocol, the signature generation protocol and the secret share refreshing protocol. Our scheme has three advantages. First, the signature generation protocol is efficient. Second, the signature generation protocol is resilient. Third, the share refreshing protocol is efficient.展开更多
We describe a batch RSA digital signature scheme in which a signer can sign messages for multiple recipients simultaneously. The construction is quite efficient due to the batch signing method. This is useful to impro...We describe a batch RSA digital signature scheme in which a signer can sign messages for multiple recipients simultaneously. The construction is quite efficient due to the batch signing method. This is useful to improve the performance of a high-loaded signing server, for example a secure electronic transaction （SET） gateway. Theoretical calculations and experimental results show that the proposed scheme can improve the performance of the signing server significantly.展开更多
文摘Bunder等人于2016年提出了利用连分式方法求解模方程中未知变量的问题,并将该问题扩展到对三种RSA变型方案的安全性分析.该模方程的表达式为ed≡1 mod (p^2-1)(q^2-1),其中N=pq为RSA模数,且p和q的规模是任意的, e和d分别为方案的公钥和私钥.类似于RSA方案的小解密指数分析, Bunder等人给出了基于上述模方程的相关小解密指数分析结果.本文利用Coppersmith方法大幅度改进了Bunder等人的分析结果,扩大了可以实现的上述三种变型RSA方案小解密指数攻击的参数范围.对于上述模方程中的未知变量的求解,我们在构造格时,通过添加额外的参数使得p和q在不同规模下,尽可能优化格的构造,提升了之前的结果.最后,通过实验验证了我们的方法.
文摘A proactive threshold signature scheme is very important to tolerate mobile attack in mobile ad hoc networks. In this paper, we propose an efficient proactive threshold RSA signature scheme for ad hoc networks. The scheme consists of three protocols: the initial secret share distribution protocol, the signature generation protocol and the secret share refreshing protocol. Our scheme has three advantages. First, the signature generation protocol is efficient. Second, the signature generation protocol is resilient. Third, the share refreshing protocol is efficient.
基金the National Basic Research Program(973) of China (No. 2005CB321804)
文摘We describe a batch RSA digital signature scheme in which a signer can sign messages for multiple recipients simultaneously. The construction is quite efficient due to the batch signing method. This is useful to improve the performance of a high-loaded signing server, for example a secure electronic transaction （SET） gateway. Theoretical calculations and experimental results show that the proposed scheme can improve the performance of the signing server significantly.
