Sequential LSB steganography embeds messages in the carrier by replacing consecutive LSBs. Its extraction attack problem is essentially the estimation problem of the start and end points of message embedding. This paper establishes an extraction attack model for sequential LSB steganography and transforms the extraction attack problem into a type of sorting problem. For the case of unknown embedding rate, an extraction attack algorithm with a computational complexity of O(n) is proposed. For the case of known embedding rate, a fast extraction attack algorithm with a computational complexity of O(2logn) is given. An extraction attack on the sequential JSteg algorithm is implemented. Keywords: steganalysis; LSB embedding; extraction attack; sequential JSteg
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore