摘要
针对方程式重排序等算法存在的程序运行速度、信息隐藏量等问题,提出基于方程式操作数系数排列逆序数的软件水印算法。重新排列那些可以相互交换的操作数,使各操作数的系数按照一定次序排列。通过排列的逆序数和二进制数的一一对应关系来隐藏水印。这一方法无须向程序中添加任何代码,并且能有效提高隐藏数据的效率,程序的规模和速度并不受影响。
Aiming at speed of the program and capacity of hidden information in traditional algorithms as equation reordering, this paper proposed a new algorithm based on inverse number of equation' s operand coefficient. Reordered the operands that could be swapped, so that arranged the coefficients of the operands with a certain order. Embedded the watermark in one-to-one relationship between the inverse number and the binary number. This method is that no code added to the program, and can effectively improve the efficiency of hidden data. The size and speed of the program is not changed.
出处
《计算机应用研究》
CSCD
北大核心
2010年第2期748-750,共3页
Application Research of Computers
基金
桂林电子科技大学博士科研基金资助项目(Z206116)
广西研究生教育创新计划资助项目(2009105950812M23)
关键词
软件水印
映射字典
排列
逆序数
software watermarking
mapping dictionary
permutation
inverse number