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.

• Type: Conference
• Year: 2004
• Where: SSWMC
• Authors: Rajarathnam Chandramouli, Shalin P. Trivedi, R. N. Uma
• Keywords: Knapsack Problem, Pseudo-polynomial Time Algorithm, Security Privacy, SSWMC 2004, Steganography Problem