Open AccessAnalysis of Modified Least Significant Bit Polynomial Function Algorithm For Securing Digital Image
Author(s) -
Dian Rachmawati,
Amer Sharif,
Muhammad Adrinta Abdurrazzaq
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1235/1/012073
Subject(s) - least significant bit , steganography , cover (algebra) , byte , polynomial , digital image , image (mathematics) , computer science , algorithm , pixel , function (biology) , mathematics , theoretical computer science , artificial intelligence , image processing , statistics , computer hardware , mechanical engineering , mathematical analysis , evolutionary biology , engineering , biology
Nowadays, there are many types of information, among which is the digital image. Some information must be secured, so it has to be made confidential. One of the methods to secure data is by steganography, wherein information is hidden inside another media called cover. Least Significant Bit (LSB) is the smallest bit in the binary array from the value of a byte. The polynomial function is the total of the power product in one or more variables with coefficients. The digital image can be used as a cover in steganography. The pixel selection for containing the message may be determined by the polynomial function so that the polynomial function can be used as the embedding and extraction key. The larger the ratio between the dimensions of the cover image to the image message, the better values of PSNR and MSE obtained. It can be concluded that the combination of the LSB method and polynomial function may serve as a modification to the LSB method in steganography.