摘要
给出了若干适用于信息隐藏技术的伪随机序列生成算法,并就这些伪随机序列的最小周期、线性复杂度、游程分布、实现效率进行了初步讨论,提出了对利用伪随机序列进行信息埋藏常规方法的一种改进。目的是充分利用遮盖信息中可隐藏信息空间,可先验地确定给定遮盖信息中可隐藏信息的长度。
Gives some preudo-random sequences generation algorithms to be applicable to the information hiding, and discusses these preudo-random sequences with their minimum periods, linear complicacy, randomicity of running length and generation efficiency. Then, puts forward a improvement for the normal methods with preudo-random sequence in information hiding technology. This method can be used to enumerate transcendental length of hiding data in the cover information and share adequately space inside the cover information.
出处
《江汉大学学报（自然科学版）》
2003年第3期34-36,共3页
Journal of Jianghan University：Natural Science Edition
基金
武汉市科技计划项目[20015007090]
