A New Digital Image Steganography Approach Based on The Galois Field GF(pm) Using Graph and Automata

• Nguyen Huy Truong,

Vol. 13, No. 9, September 29, 2019
10.3837/tiis.2019.09.025, Download Paper (Free):

• cryptography
• Steganography
• Module
• Galois field
• graph
• Automata.

Abstract

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field using graph and automata to design the data hiding scheme of the general form for binary, gray and palette images with the given assumptions, where are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

Statistics

Cite this article