Abstract

This paper presents a register-dependence-based method to identify the steganography software. Because in binary executable programmes, the registers are the data store components in common use, the proposed method considers the data dependence relationships when accessing data stored in the registers. Based on these dependence relationships, the given programme is divided into many code modules whose instruction mnemonic sequences are used as templates to compute the matching degree between two code modules. Finally, the idea of bipartite graph matching is adopted to compute the matching degree of the given software to the known steganography software, which is used to identify the steganography software and their variants. Experimental results show that the proposed method can identify the known steganography software’s variants effectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.