基于Shamir秘密共享的多重签名方案计算捷径
A Count Shortcut of Multi-signature Scheme Based on Shamir’s Secret Sharing
-
摘要: 证明了n∏j=1,j≠i(i-j)n∏j=1,j≠i(-j),给出了Li的计算公式,从而降低了基于Sham ir秘密共享的密钥分配方案的计算量.Abstract: This paper proves ∏nj=1,j≠i(i-j)∏nj=1,j≠i(-j),gives formula of couputing L_i,cuts down amount of count of key distribate scheme based on Shamir's secret sharing.
下载: