Skip to main content
Log in

Discrete Chaotic Transformations of Hidden Messages to Disguise Them as Noise in Steganography Problems

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The paper considers the problem of masking a hidden message in HUGO stegosystems under natural noise in the communication channel using discrete chaotic Arnold cat map and baker map, which are iterative reversible discrete transformations in highly undetectable HUGO stegosystems. To estimate the level of the chaotic state of a hidden message represented by a digital still image, the authors introduce the concept of the chaotic coefficient, which is a numerical indicator of the entropy of the probability of disordered pixels. The authors propose a method for determining the maximum value of the chaotic coefficient corresponding to the entire chaotic state of the hidden image.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.

Similar content being viewed by others

REFERENCES

  1. Benguigui, L., The different paths to entropy, Europ. J. Phys., 2013, vol. 34, p. 303.  https://doi.org/10.1088/0143-0807/34/2/303

    Article  MATH  Google Scholar 

  2. Peng, H., Long, F., and Ding, C., Feature selection based on mutual information criteria of max-dependency, max-relevance, and, min- redundancy, IEEE Trans. Pattern Anal. Mach. Intell., 2005, vol. 27, no. 8, pp. 1226–1238. https://doi.org/10.1109/TPAMI.2005.159

    Article  Google Scholar 

  3. Pál, D., Póczos, B., and Szepesvári, C., Estimation of Rényi entropy and mutual information based on generalized nearest-neighbor graphs, Proc. 23rd Int. Conf. on Neural Information Processing Systems, Vancouver, 2010, Red Hook, N.Y.: Curran Associates, 2010, vol. 2, pp. 1849–1857. arXiv:1003.1954 [stat.ML]

  4. Archer, E., Park, I.M., and Pillow, J.W., Bayesian entropy estimation for countable discrete distributions, J. Mach. Learning Res., 2014, vol. 15, no. 81, pp. 2833–2868. http://jmlr.org/papers/v15/archer14a.html.

    MathSciNet  MATH  Google Scholar 

  5. Hall, P. and Morton, S.C., On the estimation of entropy, Ann. Inst. Stat. Math., 1993, vol. 45, no. 1, pp. 69–88.  https://doi.org/10.1007/BF00773669

    Article  MATH  Google Scholar 

  6. Miller, E.G., A new class of entropy estimators for multi-dimensional densities, IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, Hong Kong, 2003, IEEE, 2003, pp. 297–300.  https://doi.org/10.1109/ICASSP.2003.1199463

  7. Sricharan, K., Wei, D., and Hero, A.O., Ensemble estimators for multivariate entropy estimation, IEEE Trans. Inf. Theory, 2013, vol. 59, no. 7, pp. 4374–4388.  https://doi.org/10.1109/TIT.2013.2251456

    Article  MathSciNet  MATH  Google Scholar 

  8. www.sgtnd.narod.ru/science/cat/classic/img/cat.gif.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. N. Kustov.

Ethics declarations

The authors declare that they have no conflicts of interest.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kustov, V.N., Krasnov, A.G. Discrete Chaotic Transformations of Hidden Messages to Disguise Them as Noise in Steganography Problems. Aut. Control Comp. Sci. 55, 1129–1135 (2021). https://doi.org/10.3103/S0146411621080186

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411621080186

Keywords:

Navigation