A Software Watermarking Algorithm Based on the Full Array of Expression Coefficients

In order to solve the problem of low message hidden rate and against attacks, this paper proposed an algorithm based on a full array of expressions coefficient. Algorithm through coefficient expressions of permutations and binary number and sequence number of one-to-one correspondence to construct a mapping dictionary. Then the mapping dictionary is used to embedding and extracting watermark. At last, the program which embedded watermark is encrypted by AES module. This algorithm is used to concrete some real examples on the SandMark platform, and then it is compared with the Monden algorithm, Mohammad algorithm and inverse number algorithm in performance. Theoretical analysis and experimental results proves that the algorithm is significantly improved anti attack and data rate.

[1]  Tareek M. Pattewar,et al.  Software birthmark based theft detection of JavaScript programs using agglomerative clustering and Frequent Subgraph Mining , 2014, 2014 International Conference on Embedded Systems (ICES).

[2]  Katsuro Inoue,et al.  A practical method for watermarking Java programs , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.

[3]  Tareek Pattewar,et al.  Software birthmark based theft detection of JavaScript programs using agglomerative clustering and improved frequent subgraph mining , 2014, 2014 International Conference on Advances in Electronics Computers and Communications.

[4]  Siu-Ming Yiu,et al.  Heap Graph Based Software Theft Detection , 2013, IEEE Transactions on Information Forensics and Security.

[5]  Wang Lei.  The Research and Practice of Computer Graphics Teaching Reform Based on Algorithm demonstration and Algorithm training , 2013 .

[6]  Xuan Ai-cheng.  Software watermarking algorithm based on inverse number of expression , 2009 .