Matrix Embedding Using Random Linear Codes and Its Steganalysis
To improve embedding efficiency, one of the most important steganographic scheme isMatrix embedding, otherwise known as syndrome coding. The schemes that employ matrix embedding is generally more secure because it brings about lower embedding changes.. In this paper matrix embedding scheme based on random linear codes of small dimension is considered. It is suitable for large payloads which makes it appropriate for practical applications. This scheme is efficient for embedding messages close to the embedding capacity. This scheme not only provides high embedding capacity but also enhances the quality of the stego image. The method is proved to withstand attacks like Chi-square and RS steganalysis.
KeywordsSteganography Binary Linear Codes Matrix Embedding Chisquare RS steganalysis
Unable to display preview. Download preview PDF.
- 3.Williams, F.J.M., Sloane, N.J.: The Theory of Error-correcting Codes. North-Holland, Amsterdam (1997)Google Scholar
- 4.Galand, F., Kabatiansky, G.: Information hiding by coverings. In: Proc. ITW 2003, pp. 151–154 (2003)Google Scholar
- 6.Fridrich, J., Goljan, M.: Practical Steganalysis-State of the Art. In: Proc. SPIE Photonics West, Electronic Imaging, Security and Watermarking of Multimedia Contents, San Jose, California, vol. 4675, pp. 1–13 (January 2002)Google Scholar
- 7.Fridrich, J., Goljan, M., Du, R.: Reliable detection of LSB steganography in grayscale and color images. In: Proc. ACM Workshop on Multimedia and Security, Ottawa, Canada, pp. 27–30 (2001)Google Scholar
- 8.Westfeld, A., Pfitzmann, A.: Attacks, on Steganographic Systems: Breaking the Steganographic Utilities EzStego, Jsteg, Steganos, and S-Tools–and Some Lessons Learned. In: 3rd International Workshop on Information Hiding (2000)Google Scholar