Sciweavers

    SSWMC
    2004
    156views Security Privacy» more  SSWMC 2004»
    On the complexity and hardness of the steganography embedding problem
    15 years 4 months ago
    On the complexity and hardness of the steganography embedding problem
    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 g...
    Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.