{"title":"New approach toward data hiding using XOR for image steganography","authors":"Kamaldeep Joshi, Rajkumar Yadav","doi":"10.1109/IC3.2016.7880204","DOIUrl":null,"url":null,"abstract":"With the growth in internet usage, there is a proportional growth in security and privacy demands. In this paper, a three bit XOR steganography system for concealing messages into gray Images is projected. In this method, last three bits of pixel value offer 100 percentage of message addition. This new technique uses the XOR operation between the message and original image. If the intruder extracts the last three bits, he would not be able to find the meaning of the message as the message is in decoded form. The maximum no of bit which is to be hidden using this method is equal to the R∗C∗3, where R and C is the rows and column of the image. The time complexity is also calculated which is equal to O(1). Later on the method is analysed on the bases of PSNR, MSE, L2RAT and MAXERR. The projected technique is also matched with other similar techniques to show the superiority.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Ninth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2016.7880204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
With the growth in internet usage, there is a proportional growth in security and privacy demands. In this paper, a three bit XOR steganography system for concealing messages into gray Images is projected. In this method, last three bits of pixel value offer 100 percentage of message addition. This new technique uses the XOR operation between the message and original image. If the intruder extracts the last three bits, he would not be able to find the meaning of the message as the message is in decoded form. The maximum no of bit which is to be hidden using this method is equal to the R∗C∗3, where R and C is the rows and column of the image. The time complexity is also calculated which is equal to O(1). Later on the method is analysed on the bases of PSNR, MSE, L2RAT and MAXERR. The projected technique is also matched with other similar techniques to show the superiority.
随着互联网使用的增长,对安全和隐私的需求也相应增长。本文提出了一种将信息隐藏到灰度图像中的三位异或隐写系统。在这种方法中,像素值的最后三位提供了100%的消息添加。这种新技术使用消息和原始图像之间的异或操作。如果入侵者提取了最后三位,他将无法找到消息的含义,因为消息是以解码的形式存在的。使用这种方法要隐藏的最大比特数等于R * C * 3,其中R和C是图像的行和列。同时计算时间复杂度为0(1)。然后,在PSNR、MSE、L2RAT和MAXERR的基础上对该方法进行了分析。投影技术还与其他类似技术进行了对比,以显示其优越性。