An improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.

Authors
Mohammad Reza Sadeghi Rafsanjani
Reza Meshkin Sani
Parvaneh Amirzade Dana
Amirkabir University of Tehran
Abstract
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding roots of quadratic and cubic polynomials in Galois field. The computational complexity of the proposed method is linear and space complexity is polynomial of order 2.
Keywords
BCH coding
Steganography
Characteristic of the syndrome
Syndrom coding
Syndrom
1. Y. Wang and P. Moulin, “Perfectly secure steganography: Capacity,error exponents, and code constructions,” IEEE Trans. Inf. Theory, vol.54, no. 6, pp. 2706–2722, Jun. 2008.

2. A. Ker, “The square root law in stegosystems with imperfect information,” in Information Hiding, ser. Lecture Notes Comput. Sci.. Berlin,Germany: Springer, 2010, vol. 6387, pp. 145–160.

3. R. Crandall, Some notes on steganography 1998 [Online]. Available:http://os.inf.tu-dresden.de/westfeld/crandall.pdf.

4. D. Schönfeld and A. Winkler, “Embedding with syndrome coding based on BCH codes,” in Proc. 8th ACM Workshop Multimedia Security, 2006, pp. 214–223.

5. D. Schönfeld and A. Winkler, “Reducing the complexity of syndromecoding for embedding,” in Information Hiding, ser. Lecture Notes Comput. Sci.. Berlin, Germany: Springer, 2007, vol.4567, pp.145–158.

6. C. Fontaine and F. Galand, “How Reed–Solomon codes can improve steganographic schemes,” EURASIP J. Inf. Security, vol. 2009, pp.274845-1–274845-10, 2009.

7. A. Westfeld, “F5: A steganographic algorithm, “High capacity despite better steganalysis”, in Information Hiding, ser. Lecture Notes Comput. Sci.. Berlin, Germany: Springer, 2001, vol. 2137, pp.289–302.

8. Y. Kim, Z. Duric, and D. Richards, “Modified matrix encoding technique for minimal distortion steganography,” in Information Hiding,ser. Lecture Notes Comput. Sci.. Berlin, Germany: Springer, 2007,vol. 4437, pp. 314–327.

9. R. Zhang,V. Sachnev and H.J. Kim, "Fast BCH Syndrome Coding for Steganography," in Information Hiding. vol. 5806, S. Katzenbeisser and A.-R. Sadeghi, Eds., ed: Springer Berlin Heidelberg, 2009, pp. 48-58.

10. D. Gorenstein, W. W. Peterson, and N. Zierler, “Two error correcting Bose–Chaudhuri–Hocquenghem codes are quasi-perfect,” Inf. Control,vol. 3, pp. 291-294,1960.

11. Van, Nguyen Thi Phuoc, and Pham Khac Hoan. "A novel method of decoding the BCH code based on norm syndrome to improve the error correction efficiency." 2017 2nd Workshop on Recent Trends in Telecommunications Research (RTTR). IEEE, 2017.
Mathematical Research
Volume 8, Issue 4 - Serial Number 23
Autumn 2022
Pages 215-237