Text Based Shuffling Algorithm in Digital Watermarking

With the increasing image file size from megabyte to gigabytes, sequential Fisher-Yates shuffling algorithm step became slower and needed huge amount of memories to allocate. When allocating large megapixels index to memory array at the run time of standard personal computer, it is corrupted and existed unexpectedly because of the memory overflow problem. So, Fisher-Yates shuffling algorithm is not suitable for loading massive pixels at small memory buffer size computer in new LSB-based Steganography method. In this paper, the Text based shuffling algorithm is proposed using only necessary pixels of image according to the length of input text to solve that problem. This significantly provides the output result with faster performance in run time even running the encryption part in sequential. Moreover, the proposed algorithm does not infect the visual quality of an image even replacing the pixel selection step of a New LSB-based framework.