Designing a combinatorial Image Steganography algorithm based on game theory

Adaptive steganography methods using an adaptive criterion, sequentially or randomly, hide a message in an image. The aim of security is to reduce the probability of detecting the existence of a message. In this article, first by using game theory it is illustrated that adaptive steganography algorithms with a simulation along with a quasi-random process, named as combinatorial image steganography algorithms have higher security compared to the pure adaptive steganography algorithms. Then, this matter is shown practically by designing patterns based on entropy and the  operator for 5000 natural images. The comparison of two designed algorithms, using SRM which is one of the most famous steganography algorithms, shows about 1.5% security superiority of the combinatory method compared to the purely adaptive method.