Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chien, R.T.: Cyclic decoding produce for the Bose-Chaudhuri-Hocquenghem codes. IEEE Transactions on Information Theory 11, 549–557 (1965)
Crandall, R.: Some notes on steganography, Posted on Steganography Mailing List (1998), http://os.inf.tu-dresden.de/~westfeld/crandall.pdf
Fridrich, J., Goljan, M., Lisonĕk, P., Soukal, D.: Writing on wet paper. IEEE Transactions on Signal Processing 53(10), part 2, 3923–3935 (2005)
Gorenstein, D., Peterson, W.W., Zierler, N.: Two-error correcting Bose-Chaudhuri codes are quasi-perfect. Information and Control 3, 291–294 (1960)
Kim, Y., Duric, Z., Richards, D.: Modified matrix encoding technique for minimal distortion steganography. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol. 4437, pp. 314–327. Springer, Heidelberg (2007)
Schönfeld, D., Winkler, A.: Embedding with syndrome coding based on BCH codes. In: Proceedings of the 8th ACM Workshop on Multimedia and Security, pp. 214–223 (2006)
Schönfeld, D., Winkler, A.: Reducing the complexity of syndrome coding for embedding. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 145–158. Springer, Heidelberg (2008)
Westfeld, A.: F5: A steganographic algorithm: High capacity despite better steganalysis. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol. 2137, pp. 289–302. Springer, Heidelberg (2001)
Zhao, Z., Wu, F., Yu, S., Zhou, J.: A lookup table based fast algorithm for finding roots of quadric or cubic polynomials in the GF(2m). Journal of Huazhong University of Science and Technology (Nature Science Edition) 33(2), 70–72 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, R., Sachnev, V., Kim, H.J. (2009). Fast BCH Syndrome Coding for Steganography. In: Katzenbeisser, S., Sadeghi, AR. (eds) Information Hiding. IH 2009. Lecture Notes in Computer Science, vol 5806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04431-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-04431-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04430-4
Online ISBN: 978-3-642-04431-1
eBook Packages: Computer ScienceComputer Science (R0)