A Novel Pair and Matching Algorithm for Embedding Secret Messages in Images
This work addresses the need for higher-capacity secret communication in data-centric applications, though it appears incremental as it builds on existing pair and matching techniques.
The paper tackled the problem of limited embedding capacity in steganography by proposing a novel algorithm that matches 3 bits of secret message per pixel, achieving up to 9 bits per pixel in the best case, compared to previous methods limited to 6 bits per pixel.
Steganography has proven to be one of the practical way of securing data. It is a new kind of secret communication used to hide secret data inside other innocent digital mediums. There are various algorithms for pair and matching technique. One such method uses two bits of secret message to be matched with cover image bits. Algorithm had used only 2 pairs to be mapped. Thus limiting the matching to 6 bits per pixel. Here in our proposed algorithm we are matching 3 bits at a time. Thus in the best case scenario we can match up to 9 bits per pixel. It is also a good foundation to build more secure communication in today s data centric world.