Share Email Print
cover

Proceedings Paper

On the complexity and hardness of the steganography embedding problem
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 22 June 2004
PDF: 5 pages
Proc. SPIE 5306, Security, Steganography, and Watermarking of Multimedia Contents VI, (22 June 2004); doi: 10.1117/12.521391
Show Author Affiliations
Rajarathnam Chandramouli, Stevens Institute of Technology (United States)
Shalin P. Trivedi, Stevens Institute of Technology (United States)
R. N. Uma, Univ. of Texas at Dallas (United States)


Published in SPIE Proceedings Vol. 5306:
Security, Steganography, and Watermarking of Multimedia Contents VI
Edward J. Delp III; Ping W. Wong, Editor(s)

© SPIE. Terms of Use
Back to Top