CAJ | 학술논문

通过研究(k, n)异或视觉密码像素扩展度最优的必要条件，该文提出一种由基矩阵生成(k, n)异或视觉密码的方法，并从理论上证明了该方法适合2<k￡n的(k, n)异或视觉密码，在此基础上构造了秘密分享和恢复算法。实验结果表明，该文方案可以有效地减小像素扩展度，且能够实现秘密图像的完全恢复。
통과연구(k, n)이혹시각밀마상소확전도최우적필요조건，해문제출일충유기구진생성(k, n)이혹시각밀마적방법，병종이론상증명료해방법괄합2<k￡n적(k, n)이혹시각밀마，재차기출상구조료비밀분향화회복산법。실험결과표명，해문방안가이유효지감소상소확전도，차능구실현비밀도상적완전회복。
The necessary condition of the optimal pixel expansion is given and proved in (k, n) XOR-based Visual Cryptography Scheme (XVCS). A new method is designed for constructing (k, n)-XVCS by use of basis matrices. The method is proved to be suitable for (k, n)-XVCS with 2<k ￡n. Based on the above results, the secret sharing and recovering algorithms are proposed. The experimental results show that the pixel expansion can be decreased efficiently. Furthermore, the secret images can be recovered perfectly.