一种基于与(或)逻辑实现的信息分存算法

针对传统信息分存算法运算量大和计算复杂等问题，通过引入合式基，提出了一种基于与（或）逻辑的信息分存新算法．它可通过对合式基进行动态分组来构造不同的信息分发和恢复方案，使算法具有动态自适应能力和可扩展能力，同时利用分发恢复过程与加密伪装过程的松耦合性，并结合经典的加密和信息隐藏算法，使算法具有高安全性．实验结果表明，在同一分组内的各个分存子信息的恢复能力相同，不同分组可负责恢复分发信息的不同部分，但恢复能力不同．若分组内仅有一个合式基，则该分组内对应的分存子信息必须参与信息恢复；若分组内对应的合式基分别参与该分组不同分存子信息的构建过程，在满足约束的情况下，允许分组内若干个分存子信息不参与信息恢复，其结果并不影响分发信息的重构．

Information Sharing Algorithm Based on Conjunction and Disjunction Logic Functions

By introducing well-formed basis, a novel information sharing algorithm based on conjunction and disjunction logic functions is presented to solve the problem of high computation complexity in the classical information sharing algorithm. The new algorithm that can be implemented easily and computed at high-speed can construct different information distribution and recovery schemes to make the algorithm possess dynamic self-adaptive ability and extensibility. Furthermore, the process of distributing and recovering, which is loosely coupled with the process of encrypting and disguising, can be combined with classical algorithm of encryption and information hiding to improve the safety of information sharing algorithm. The experiments show that every distributed sub-information in the same group has the same recovery ability, and different groups are in charge of recovering different parts of distributed information with different recovery ability. If there is only one well-formed basis in a group, the distributed sub-information in the group must take part in information recovery. If different well-formed bases in a group take part in different sub-information constructing process with constraints satisfied, some distributed sub-information in the group will be admitted not to take part in information recovery without affecting the process of the whole information reconstruction.