Abstract

This research paper presents a novel approach to improving the strength of Least Significant Bit (LSB) embedding in steganography through the use of the Collatz Conjecture. LSB image steganography is commonly employed due to its simplicity of implementation. The technique involves directly replacing the message bit into the LSB of an image in a sequential manner. However, this simple technique poses a problem in LSB steganography due to its vulnerability to detection by statistical attacks. To address this issue, the study focuses on the modification of the Collatz Conjecture structure to generate random numbers for the random placement of encrypted message bits. The randomness of the generated numbers was evaluated using the NIST Test Suite, which confirmed their truly random nature. The proposed technique was then tested on 1,000 stego-images, and the results showed robust embedding with high quality as evidenced by high Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index Measurement (SSIM) values. Additionally, the method demonstrated resistance to statistical attacks, with low detection rates of 0.1084 and 0.1078 for Sample Pairs and RS Analysis, respectively. Overall, this research paper proposes an innovative technique to strengthen LSB embedding in steganography by utilizing the Collatz Conjecture. The approach demonstrates improved robustness and resistance to statistical attacks while maintaining the simplicity of the original LSB technique. The results of this study offer promising implications for the future of image steganography and data security.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call