Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Least Significant Bit Steganography using Hitzl-Zele Chaotic Map

Least Significant Bit Steganography using Hitzl-Zele Chaotic Map AbstractWe propose a novel least significant bit steganography algorithm based on a Hitzl-Zele chaotic function. On the first step a pseudorandom generator is constructed for chaotic pixel selection for hiding the secret message. Exact study has been provided on the novel scheme using visual inspection, peak signal-to-noise ratio, and histogram analysis. The experimental data show excellent performance of the novel stego technique. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Electronics and Telecommunications de Gruyter

Least Significant Bit Steganography using Hitzl-Zele Chaotic Map

Loading next page...
 
/lp/de-gruyter/least-significant-bit-steganography-using-hitzl-zele-chaotic-map-wTCOO75Ar7
Publisher
de Gruyter
Copyright
© by Krasimir Kordov
ISSN
2300-1933
eISSN
2300-1933
DOI
10.1515/eletel-2017-0061
Publisher site
See Article on Publisher Site

Abstract

AbstractWe propose a novel least significant bit steganography algorithm based on a Hitzl-Zele chaotic function. On the first step a pseudorandom generator is constructed for chaotic pixel selection for hiding the secret message. Exact study has been provided on the novel scheme using visual inspection, peak signal-to-noise ratio, and histogram analysis. The experimental data show excellent performance of the novel stego technique.

Journal

International Journal of Electronics and Telecommunicationsde Gruyter

Published: Nov 27, 2017

There are no references for this article.