A number of methods exist for hiding information in various media. These methods range from LSB coding also known as bit-plane or noise insertion tools manipulation of image or compression algorithms to modification of image properties such as luminance. Basic substitution systems try to encode secret information by substituting insignificant parts of the cover by secret message bits; the receiver can extract the information if he has knowledge of the positions where secret information has been embedded. Since only minor modifications are made in the embedding process, the sender assumes that they will not be a problem to hide out the message throughout the cover element. But as the index can appear more than once in the cover element, there might be high chances of collision where the sender will try to store many message bits in a single cover element bits. The approach provided here will try to reduce the problem of collision while inserting message bits into cover element.

1. Foley, J., et al., Computer Graphics, Principles and Practice, Reading, MA: Addison
2. Bender, W., D. Gruhl, and N. Morimoto, \Techniques for data hiding," IBM Systems Journal , vol. 35, no. 3/4, 1996, pp. 131-336.
3. M¨oller, S., A. Ptzmann, and I. Stirand, Computer Based Steganography: How It Works and Why Therefore Any Restrictions on Cryptography Are Nonsense, At Best," in Information Hiding: First International Workshop, Proceedings, vol. 1174 of Lecture Notes in Computer Science, Springer, 1996, pp. 7-21.
4. Gruhl, D., A. Lu, and W. Bender, \Echo Hiding," in Information Hiding: First Interna-tional Workshop, Proceedings, vol. 1174 of Lecture Notes in Computer Science, Springer, 1996, pp. 295-316.
5. Kurak, C., and J. McHughes, “A Cautionary Note On Image Downgrading," in IEEE Computer Security Applications Conference 1992, Proceedings, IEEE Press, 1992, pp. 153-159.
6. van Schyndel, R. G., A. Tirkel, and C. F. Osborne, A Digital Watermark," in Pro-ceedings of the IEEE International Conference on Image Processing, vol. 2, 1994, pp. 86-90.
7. Johnson, N. F., and S. Jajodia, Exploring Steganography: Seeing the Unseen," IEEE Computer , vol. 31, no. 2, 1998, pp. 26-34.
8. Gerzon, M. A., and P. G. Graven,”A High-Rate Buried- Data Channel for Audio CD," Journal of the Audio Engineering Society, vol. 43, no. 1/2, 1995, pp. 3-22.
9. Menezes, A. J., P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptog-raphy, Boca Raton: CRC Press, 1996.
10. Aura, T., \Practical Invisibility in Digital Communication," in Information Hiding: First International Workshop, Proceedings, vol. 1174 of Lecture Notes in Computer Science, Springer, 1996, pp. 265-278.
11. Luby, M., and C. Racko , \How to Construct Pseudorandom Permutations from Pseudorandom Functions," SIAM Journal on Computation, vol. 17, no. 2, 1988, pp. 373-386.
12. Naor, M., and O. Reingold, On the Construction of Pseudorandom Permutations: Luby-Racko Revisited," Journal of Cryptology, vol. 12, no. 1, 1999, pp. 29-66.
13. Bell, D. E., and L. J. LaPadula, Secure Computer Systems: Mathematical Foundations," Mitre Report ESD-TR-73-278 (Vol. I-III), Mitre Corporation, Bedford, MA, Apr. 1974.

Vectorizing bit-plane steganography LSB