1 research outputs found
On the Complexity and Hardness of the Steganography Embedding Problem
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also give a pseudo-polynomial time algorithm to optimally solve the steganography problem. This optimal algorithm can also be applied to image steganography