CHAOS BASED INDISCERNIBLE IMAGE STEGANOGRAPHY SCHEME


Borislav Stoyanov, Tsvetelina Ivanova, Dimitar Dobrev§, Plamen Ribarski 

Abstract: In the current digital era, information security is a top priority and outdated algorithms must be updated or replaced. This article presents a novel method that combines encryption and steganography to conceal secret text messages in color graphics. Using a chaotic pseudorandom generator, the position and arrangement of the picture pixels used for information embedding are chosen at pseudorandom. Another layer of protection is to encrypt the secret message before embedding it. This issue will deter attackers from looking for signs of steganography. The suggested indiscernible stegoalgorithm is being evaluated. We perform randomness tests, histograms, peak signal-to-noise ratio analysis, and other tests using conventional statistical and empirical methods. The novel results are presented and analyzed in the current article.

Keywords: chaotic functions, pseudorandom bytes, least significant bit, steganography.

MSC: 68P25, 11K45, 94A60.

DOI       10.56082/annalsarscimath.2026.2.131

Read full article

borislav.stoyanov@shu.bg, Department of Computer Informatics, Faculty of Mathematics and Informatics, University of Shumen, Shumen, Bulgaria
§ts.r.ivanova@shu.bg, Department of Computer Informatics, Faculty of Mathematics and Informatics, University of Shumen, Shumen, Bulgaria
§d.d.dobrev@shu.bg, Department of Computer Informatics, Faculty of Mathematics and Informatics, University of Shumen, Shumen, Bulgaria
p.ribarski@shu.bg, Department of Computer Informatics, Faculty of Mathematics and Informatics, University of Shumen, Shumen, Bulgaria

PUBLISHED in

Annals Academy of Romanian Scientists Series on Mathematics and Its Application,

Volume 18 no 2, 2026

       

ISSN ONLINE 2066 – 6594
ISSN PRINT 2066 – 5997