摘要
门限签名是门限密码学的重要组成部分之一,然而,由于在RSA密码体制中,模数n=pq,剩余环Z(n)不是域,其中的元素未必可逆,(n)是秘密参数,因而参与者无法进行模(n)运算,这给建立在Z(n)上的门限RSA签名方案带来了困难。结合Shoup门限RSA签名方案和最小公倍数的思想,提出一种改进门限RSA签名方案,该方案克服了Shoup方案中动态性差、计算量小等缺点。
Threshold signature is an important part of the threshold cryptography. However, with one of the RSA password system, when module n = pq , the remaining ring is not the domain. Thus, one of the elements, which may not be reversible, at the same time, is secret. So participants cannot know the operation in the threshold RSA signature scheme. Considering Shoup threshold RSA signature scheme and the minimum of LCD thought, this paper puts forward an improved threshold RSA signature scheme, to overcome the problem of fewer which calculations and poor dynamic ability.
出处
《陕西理工学院学报（自然科学版）》
2012年第1期20-23,共4页
Journal of Shananxi University of Technology:Natural Science Edition
关键词
门限签名
RSA
秘密共享
threshold signature
RSA
secret sharing
