密钥分散存储有助于提高密钥的安全性。本文基于Shamir的(t,n)门限密钥共享方案,针对t、n值选取对密钥安全性和易用性的影响关键、微妙和模糊的问题,引入Yager模糊理论第三指标,并结合精确数互补判断矩阵的排序方法建立了对(t,n)门限密钥共享方案中t、n值选取的决策方案优选方法,最后本文通过实例说明了该方法的可行性和有效性。 Key-based storage helps to improve the security of keys. In this paper, based on Shamir’s (t, n) threshold key sharing scheme, aiming at the key, subtle and ambiguous problems of t, n value selection on the key security and usability, the third indicator of Yager fuzzy theory is introduced and combined The method of sorting t and n values ​​in the (t, n) threshold key sharing scheme is established. Finally, an example is given to illustrate the feasibility and effectiveness of the method.