22 June 2004 On the complexity and hardness of the steganography embedding problem
Author Affiliations +
Abstract
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.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rajarathnam Chandramouli, Rajarathnam Chandramouli, Shalin P. Trivedi, Shalin P. Trivedi, R. N. Uma, R. N. Uma, } "On the complexity and hardness of the steganography embedding problem", Proc. SPIE 5306, Security, Steganography, and Watermarking of Multimedia Contents VI, (22 June 2004); doi: 10.1117/12.521391; https://doi.org/10.1117/12.521391
PROCEEDINGS
5 PAGES


SHARE
RELATED CONTENT


Back to Top