论文部分内容阅读
在多个参与者之间分享多幅秘密图像时,为了解决像素扩展度和相对差随着秘密图像和参与者数量的增加而分别急剧扩大和减小的问题,本文从代数结构入手,结合异或运算和柱面共享份旋转操作,给出了一种多秘密视觉密码方案的定义,能够支持(k,n)门限结构下多个秘密的分享.以基于异或的单秘密视觉密码方案的基矩阵为加密单元,设计了多秘密分享与恢复流程,给出了一种实现方案.仿真实验结果表明:本方案不仅在多个共享份之间能够分享多幅秘密图像,而且减小了像素扩展度,提高了相对差.
When multiple secret images are shared among multiple participants, in order to solve the problem of pixel expansion and relative difference rapidly expanding and decreasing with the increasing number of secret images and participants, this dissertation starts with algebraic structure, Or operation and cylindrical shared rotation operation, a multi-secret visual cipher scheme definition is proposed, which can support multiple secret sharing under (k, n) threshold structure. With XOR-based single secret visual cipher scheme The base matrix is an encryption unit, a multi-secret sharing and recovery process is designed and an implementation scheme is given. Simulation results show that the proposed scheme can not only share multiple secret images among multiple shares, but also reduce the number of pixels Expansion, improve the relative difference.