基于Shamir(t,n)门限方案的数字图象信息分存

本文基于密码学中的Shamir(t,n)门限方案研究数字图象存储与传输中的信息分存方法,主要结果是：对于给定的秘密图象A,发送者可以从任意选择的k幅（k=1,2,3,…）同样尺寸图象出发,生成作为伪装的N幅图象（N＞k);接收者可以利用这N幅图象中k 1幅恢复图象A。本文介绍了利用拉格朗日插值算法给出的分存原理,并提出一类基于射影几何学的分存算法。最后给出了实验图例和视频作品例子说明研究方法的合理性。

Digital Images Information Sharing Based on the Principle of Shamir''''s (t,n) Private Key

Based on the Principle of Shamir's ( t,n ) private key of cryptography , the method of digital images information sharing for storing and transmission is investigated in the paper. The main results are: for the original image A , the sender can choose arbitrarily any k quantity of the same size image (k =1,2,3,...)to generate N quantity of images( N>k ); by using k +1 quantity of these N images, the receiver can restore the original image. The principle using Lagrange interpolation algorithm and a scheme for information sharing based on the projective geometry are also introduced . In order to explain the reasoning, some examples of images and works of video are illustrated .