On the complexity and hardness of the steganography embedding problem

13 years 6 months ago

Download www.ece.stevens-tech.edu

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.

Real-time Traffic

Knapsack Problem | Pseudo-polynomial Time Algorithm | Security Privacy | SSWMC 2004 | Steganography Problem |

claim paper

» Hardness and approximation of minimum distortion embeddings

» Nonblocking Deterministic Replacement of Functionality Timing and DataFlow for Hard RealTi...

» Fast Calculation of Permissible Slowdown Factors for Hard RealTime Systems

» Adding Hard Realtime Capabilities to CORBA

» Adding one edge to planar graphs makes crossing number hard

» QuasiStatic Scheduling for Multiprocessor RealTime Systems with Hard and Soft Tasks

» An Integrated Approach for Applying Dynamic Voltage Scaling to Hard RealTime Systems

» Complexity Management for Composable RealTime Systems

Post Info
More Details (n/a)

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)

Sciweavers

On the complexity and hardness of the steganography embedding problem

Knapsack Problem | Pseudo-polynomial Time Algorithm | Security Privacy | SSWMC 2004 | Steganography Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers