论文部分内容阅读
本文建议利用孙子定理把通信密钥分拆成n个子数据,交n个人员分散保管,在n个子数据中,只要知道任意K(1≤K≤n)个,即可恢复通信密钥,如知道的密钥子数据数少于K个,就不能恢复密钥。通信密钥的这种分散保管方案,可大大提高密钥保管的安全性、保密性、可靠性和灵活性。
In this paper, we propose to use Sun Tzu’s theorem to split the communication key into n sub-data and to share n individuals in a decentralized manner. In n sub-data, as long as we know any K (1≤K≤n), we can recover the communication key, Knowing the number of key sub-data is less than K, you can not recover the key. This decentralized storage scheme for communication keys greatly improves the security, confidentiality, reliability and flexibility of keykeeping.