CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Message Guided Adaptive Random Steganography using Counting-out Embedding

by Ravuru Rakesh, Shantan Devathi, Prashanth Sekhar Chandra Sekaran, Bala Surendra Kumar Tatikonda
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 24 - Number 6
Year of Publication: 2011
Authors: Ravuru Rakesh, Shantan Devathi, Prashanth Sekhar Chandra Sekaran, Bala Surendra Kumar Tatikonda
10.5120/2949-3951

Ravuru Rakesh, Shantan Devathi, Prashanth Sekhar Chandra Sekaran, Bala Surendra Kumar Tatikonda . Message Guided Adaptive Random Steganography using Counting-out Embedding. International Journal of Computer Applications. 24, 6 ( June 2011), 6-9. DOI=10.5120/2949-3951

@article{ 10.5120/2949-3951,
author = { Ravuru Rakesh, Shantan Devathi, Prashanth Sekhar Chandra Sekaran, Bala Surendra Kumar Tatikonda },
title = { Message Guided Adaptive Random Steganography using Counting-out Embedding },
journal = { International Journal of Computer Applications },
issue_date = { June 2011 },
volume = { 24 },
number = { 6 },
month = { June },
year = { 2011 },
issn = { 0975-8887 },
pages = { 6-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume24/number6/2949-3951/ },
doi = { 10.5120/2949-3951 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:10:14.771889+05:30
%A Ravuru Rakesh
%A Shantan Devathi
%A Prashanth Sekhar Chandra Sekaran
%A Bala Surendra Kumar Tatikonda
%T Message Guided Adaptive Random Steganography using Counting-out Embedding
%J International Journal of Computer Applications
%@ 0975-8887
%V 24
%N 6
%P 6-9
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Digital data protection turns out to be the most essential constituent in the cyber world where digital crime is mounting to its worst. To establish secured data communication a technique called Steganography, one of the fruitful attempts for data hiding, has evolved. The rationale of this scheme is to blot out the message in to an innocuous cover media. For good stego system imperceptibility, randomization and capacity are the important considerations. In this paper we propose a novel keyless random algorithm in image steganography which induces an enhanced security by incorporating “counting-out” embedding. It uses message bits embedded in the current pixel which acts as a key for the next pixel to which data is to be embedded. This method provides adaptive randomization without affecting the imperceptibility and capacity.

References
  1. BruiceSchneier, Applied Cryptography Protocols, Algorithm and Source Code in C. second edition. Wiley India edition 2007
  2. R. L. Rivest, A. Shamir, and L. Adleman, ―A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol. 21, no. 2, (1978) 120–126.
  3. W. Diffie and M. E. Hellman, ―Exhaustive Cryptanalysis of the NBS Data Encryption Standard, IEEE Computer, Vol.10, 1977, pp. 74-84.
  4. Moerland, T., “Steganography and Steganalysis”, Leiden Institute of Advanced Computing Science,
  5. Silman, J., “Steganography and Steganalysis: An Overview”, SANS Institute, 2001
  6. C.K. Chan, L.M. Chen, Hiding data in images by simple LSB substitution, Pattern Recognition 37 (3) (2004) 469–474.
  7. Jamil, T., “Steganography: The art of hiding information is plain sight”, IEEE Potentials, 18:01, 1999
  8. Marvel, L.M., Boncelet Jr., C.G. &Retter, C., “Spread Spectrum Steganography”, IEEE Transactions on image processing, 8:08, 1999
  9. Johnson, N.F. &Jajodia, S., “Exploring Steganography: Seeing the Unseen”, Computer Journal, February 1998
  10. C.C. Thien, J.C. Lin, A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function, Pattern Recognition 36 (11) (2003) 2875–2881.
  11. S. Katzenbeisser, F.A.P. Petitcolas, Information Hiding Techniques for Steganography and Digital Watermarking, Artech House, Norwood, MA, 2000.
  12. Krenn, R., “Steganography and Steganalysis”
  13. W. Bender, D. Gruhl, N. Morimoto, A. Lu, Techniques for data hiding, IBM Syst. J. 35 (3&4) (1996) 313–336.
  14. Adnan Gutub, "Pixel Indicator Technique for RGB Image Steganography", Journal of Emerging Technologies in Web Intelligence (JETWI) (2010)2(1) 56-64
  15. Westfeld Space filling curves in steganalysis in E.J Delp III & P.W. Wong(Eds), Security, steganography and watermarking of multimedia contents VII SPIE 5681, (2005) 28-37
  16. Yuan-Hui Yu , Chin-Chen Chang, Iuon-Chang Lin, A new steganographic method for color and grayscale image hiding, Computer Vision and Image Understanding 107 (2007) 183–194
  17. F.A.P. Petitcolas, R.J. Anderson, M.G. Kuhn, Information hiding—a survey, Proc. IEEE 87 (7) (1999) 1062–1078.
  18. Young-Ran Park, Hyun-Ho Kang, Sang-Uk Shin, and Ki-Ryong Kwon, An Image Steganography Using Pixel Characteristics Y. Hao et al. (Eds.): CIS 2005, Part II, Springer-Verlag Berlin Heidelberg LNAI 3802, (2005) 581– 588.
  19. RavuruRakesh, ShantanDevathi, PrashanthSekhar Chandra Sekaran, SiramSanath Kumar, Adaptive Randomization in Image Steganography Pertaining to Most Significant Nibble, International Journal of Computer Applications (0975 – 8887), Volume 22 – No. 3, May 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Information hiding Image Steganography Counting-out embedding Adaptive randomization

Powered by PhDFocusTM