Sciweavers

Share
SSWMC
2004

On the complexity and hardness of the steganography embedding problem

9 years 10 months ago
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.
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N.
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where SSWMC
Authors Rajarathnam Chandramouli, Shalin P. Trivedi, R. N. Uma
Comments (0)
books