The Optimized Subkey Distribution Algorithm in Threshold RSA
Jing Cui · Chinese Journal of Computers · 2005
The ( t,n ) threshold RSA algorithm enables the system to keep the security and availability of the private key without a trusted dealer when parts of system are already under attack. In the traditional threshold RSA sub key distribution scheme, each party that shares the private key in the form of d=∑d i must keep C t n sub keys secretly in order to enable the whole system to reconstruct the original private key by any t out of n parties. It is the simplest one of all the forms of sharing RSA key and it has the best efficiency out of them. However C t n increases with the scale of intrusion tolerance (IT) system very quickly. So it is very important to decrease the number of sub keys which belong to each party to enhance the IT ability of the ITS. This paper presents a scalable searching algorithm, which can find out the optimized sub key distribution scheme that can decrease the number of sub keys that should be held by each party without weakening the system’s security. And an optimized scheme is found and listed in this paper. It can greatly reduce the complexity of key management and related operations in signing and decryption.