| 基于XOR的(2，2，n)多秘密视觉密码 |
| |
| 引用本文： | 沈 刚,付正欣,郁 滨. 基于XOR的(2，2，n)多秘密视觉密码[J]. 计算机应用研究, 2012, 29(10): 3797-3799 |
| |
| 作者姓名： | 沈 刚 付正欣 郁 滨 |
| |
| 作者单位： | 解放军信息工程大学, 郑州 450004 |
| |
| 基金项目： | 国家自然科学基金资助项目（61070086）; 河南省杰出青年科学基金资助项目（094100510002） |
| |
| 摘 要： | 针对现有多秘密视觉密码方案像素扩展度较大和相对差较小的问题,从像素扩展度与秘密数量之间的关系入手,通过设计关联算法和分享算法,提出了一种基于XOR运算的(2,2,n)多秘密视觉密码方案,该方案能够利用XOR和OR两种运算来恢复任意数量的秘密图像。实验结果表明,该方案在像素扩展度和相对差上与以往方案相比都有较大改善。
|
| 关 键 词： | 视觉密码 多秘密 像素扩展度 相对差 XOR |
XOR-based(2,2,n) multi-secret visual cryptography |
| |
| SHEN Gang,FU Zheng-xin,YU Bin. XOR-based(2,2,n) multi-secret visual cryptography[J]. Application Research of Computers, 2012, 29(10): 3797-3799 |
| |
| Authors: | SHEN Gang FU Zheng-xin YU Bin |
| |
| Affiliation: | PLA Information Engineering University, Zhengzhou 450004, China |
| |
| Abstract: | Aiming at the large pixel expansion and low relative difference among the existing multi-secret visual cryptography schemes, starting with the relationship between the pixel expansion and the number of secret images, this paper proposed a XOR-based 2, 2, n multi-secret visual cryptography scheme through the relation algorithm and the share algorithm. This scheme could reconstructed any amount of secret images not only with the XOR operation but also with the OR operation. The experimental results demonstrate that the pixel expansion and relative difference are improved compared with the previous schemes. |
| |
| Keywords: | visual cryptography multi-secret pixel expansion relative difference XOR |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
