In this paper, we propose a new digital watermarking algorithm based on quadratic knapsack problem, which belongs to public-key cryptosystem.
本文通过研究公钥密码学中的二次背包体制，给出了一种基于二次背包加密的数字水印算法。
The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.
把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。
应用推荐