在图视秘密分散存储（简称分存）中，任意分存方案可比一般的分存方案更有效地隐蔽秘密信息，因而有着重要的实用意义．本文在Ｓｈａｍｉｒ提出的图机密码的基础上，明确给出了任意分存的概念，并提出了根据（ｋ，ｎ）分存方案构造任意（ｋ，ｎ）分存方案的方法，此外，还给出了由（ｋ，ｋ）分存方案构造任意（ｋ，ｋ）分存方案的简便方法，并证明了其有效性． In the case of decentralized storage (referred to as share deposit), the arbitrary share plan can hide the secret information more effectively than the general share plan, which is of great practical significance. Based on Shamir’s machine code, this paper gives a clear concept of arbitrary memory and proposes a method of constructing an arbitrary (k, n) memory scheme according to (k, n) memory scheme. In addition, A simple and convenient method of constructing an arbitrary (k, k) sharing solution by (k, k) sharing solution is given and its validity is proved.