Research Journal of Information Technology1815-74322151-7959Academic Journals Inc.10.3923/rjit.2013.87.99AmirtharajanR.SubrahmanyamR.TejaJasti NithinReddyKatkuri MahendarRayappanJ.B.B.2201352In this study, a secure mode of steganography is projected in which three main entities are exercised. They are Pseudo random generator, Least Significant Bit (LSB) substitution and Optimal Pixel Adjustment Process (OPAP). A popular cliché “All roads lead to Rome” says that there endure countless ways to attain a target. Likewise, this goes very well with Steganography than any other things. Digital epoch of steganography embraces numerous trials to surmount the universal hitch of concealment and refuge in every form of computer communication. This study reveals one more methodology for the same but with unique characteristics. Here, cyclic pixel indicator technique is used wherein two channels are used as data channels and the remaining channel is used as an indicator channel. Red plane is taken as the indicator channel for the first pixel for the subsequent pixels the indicator channels follows a periodic cycle of R, G, B. barring the indicator channel, the other two channels act as the data channels for the corresponding pixels. The pixel intensity determines the bits to be embedded. i.e., LSB’s of the indicator channel. If the LSB’s of indicator channel say R channel are 00 Embed 1 bit in G and 2 bits in B; in case of 01, embed 2 bits in G and B each. If LSB(R) is 10, 2 are inlayed in G and 3 bits in B. Finally id LSB(R) equals 11 and then 3 bits are ingrained in G and 3 bits in B. A novel 2-key based pseudo random generator is employed which is used to embed data completely in a unique random fashion based on user’s choice. Thus, it introduces obscurity, while composite embedding of secret bits will result in additional intricacy. Therefore, this study is yet another practical cum unassailable means for secret sharing. Justification for this study is provided by the analytical results.]]>Abdulfetah, A.A., X. Sun, H. Yang and N. Mohammad,2010Al-Azawi, A.F. and M.A. Fadhil,2010Al-Frajat, A.K., H.A. Jalab, Z.M. Kasirun, A.A. Zaidan and B.B. Zaidan,2010Amirtharajan, R. and J.B.B. Rayappan,2012Amirtharajan, R. and J.B.B. Rayappan,2012Amirtharajan, R. and J.B.B. Rayappan,2012Amirtharajan, R. and J.B.B. Rayappan,2012Amirtharajan, R., J. Qin and J.B.B. Rayappan,2012Bender, W., D. Gruhl, N. Morimoto and A. Lu,1996Chan, C.K. and L.M. Cheng,2004Cheddad, A., J. Condell, K. Curran and P. McKevitt,2010Gutub, A.A.A.,2010Hmood, A.K., B.B. Zaidan, A.A. Zaidan and H.A. Jalab,2010Hmood, A.K., H.A. Jalab, Z.M. Kasirun, B.B. Zaidan and A.A. Zaidan,2010Janakiraman, S., R. Amirtharajan, K. Thenmozhi and J.B.B. Rayappan,2012Janakiraman, S., R. Amirtharajan, K. Thenmozhi and J.B.B. Rayappan,2012Kahn, D.,1983Luo, H., Z. Zhao and Z.M. Lu,2011Mohammad, N., X. Sun and H. Yang,2011Padmaa, M., Y. Venkataramani and R. Amirtharajan,2011n: 1 Platform for users and embedding.]]>Provos, N. and P. Honeyman,2003Qin, J., X. Xiang and M.X. Wang,2010Rajagopalan, S., R. Amirtharajan, H.N. Upadhyay and J.B.B. Rayappan,2012Salem, Y., M. Abomhara, O.O. Khalifa, A.A. Zaidan and B.B. Zaidan,2011Schneier, B.,2007Stefan, K. and A. Fabin,2000Thanikaiselvan, V., P. Arulmozhivarman, R. Amirtharajan and J.B.B. Rayappan,2011Thanikaiselvan, V., S. Kumar, N. Neelima and R. Amirtharajan,2011Thenmozhi, K., P. Praveenkumar, R. Amirtharajan, V. Prithiviraj, R. Varadarajan and J.B.B. Rayappan,2012Xiang, L., X. Sun, Y. Liu and H. Yang,2011Zaidan, B.B., A.A. Zaidan, A.K. Al-Frajat and H.A. Jalab,2010Zanganeh, O. and S. Ibrahim,2011Zeki, A.M., A.A. Manaf and S.S. Mahmod,2011Zhao, Z. and H. Luo,2012Zhu, J., R.D. Wang, J. Li and D.Q. Yan,2011Zhang, Y.H., B.S. Kang and X.F. Zhang,2006