TY - GEN
T1 - Fast BCH syndrome coding for steganography
AU - Zhang, Rongyue
AU - Sachnev, Vasiliy
AU - Kim, Hyoung Joong
PY - 2009
Y1 - 2009
N2 - This paper presents an improved data hiding technique based on BCH (n,k,t) syndrome coding. The proposed data hiding method embeds data to a block of input data (for example, image pixels, wavelet or DCT coefficients, etc.) by modifying some coefficients in a block in order to null the syndrome of the BCH coding. The proposed data hiding method can hide the same amount of data with less computational time compared to the existed methods. Contributions of this paper include the reduction of both time complexity and storage complexity as well. Storage complexity is linear while that of other methods are exponential. Time complexity of our method is almost negligible and constant for any n. On the other hand, time complexity of the existing methods is exponential. Since the time complexity is constant and storage complexity is linear, it is easy to extend this method to a large n which allows us to hide data with small embedding capacity. Note that small capacities are highly recommended for steganography to survive steganalysis. The proposed scheme shows that BCH syndrome coding for data hiding is now practical ascribed to the reduced complexity.
AB - This paper presents an improved data hiding technique based on BCH (n,k,t) syndrome coding. The proposed data hiding method embeds data to a block of input data (for example, image pixels, wavelet or DCT coefficients, etc.) by modifying some coefficients in a block in order to null the syndrome of the BCH coding. The proposed data hiding method can hide the same amount of data with less computational time compared to the existed methods. Contributions of this paper include the reduction of both time complexity and storage complexity as well. Storage complexity is linear while that of other methods are exponential. Time complexity of our method is almost negligible and constant for any n. On the other hand, time complexity of the existing methods is exponential. Since the time complexity is constant and storage complexity is linear, it is easy to extend this method to a large n which allows us to hide data with small embedding capacity. Note that small capacities are highly recommended for steganography to survive steganalysis. The proposed scheme shows that BCH syndrome coding for data hiding is now practical ascribed to the reduced complexity.
KW - BCH coding
KW - Data hiding
KW - Error correction code
KW - Steganography
KW - Syndrome coding
UR - http://www.scopus.com/inward/record.url?scp=70350449404&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04431-1_4
DO - 10.1007/978-3-642-04431-1_4
M3 - Conference contribution
AN - SCOPUS:70350449404
SN - 3642044301
SN - 9783642044304
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 48
EP - 58
BT - Information Hiding - 11th International Workshop, IH 2009, Revised Selected Papers
T2 - 11th International Workshop on Information Hiding, IH 2009
Y2 - 8 June 2009 through 10 June 2009
ER -