Research And Realization On Algorithms Of Information Hiding Based On Images

Nowadays, information technology has been infiltrated into all aspects of the human production and life, and played a crucial role. More and more people pay attention to information security issues. Information hiding is an important branch of the field of information security technology, and has become a major research focus. Images express directly, and image contains a large amount of information, so it is an important performace information means. This paper mainly research the algorithms of information hiding based on digital images.The main results of this paper are as follows:1. A new algorithm of public image transformation for information hiding based on a new Anti_Arnold is proposed. The algorithm is not a secret image pre-processing, but a public image is transformed. Firstly, a public image is transformed by traditional Arnold transformation. Then a public image is divided up some 8×8 blocks of DCT. to transform each piece. The secret image is hided into coefficient of lower frequency. Last the public image is restored by the new Anti-Arnold transformation. So the time of calculating is reduced greatly, what's more, the security is enhanced greatly. At the end, it is tested the robustness with many attack experiments. The experimental results show that the method is available and effective.2. An algorithm of multiple digital images hiding based on image share is proposed. Firstly the secret image is shared in two independent images, and then the information hiding scheme is that the first secret image is embedded in the odd lines of public image, and the second one is embedded in the even lines. Finally, multiple images are hided in one public image. The experiment is taken that two images are hiding into one public image. The characteristics of the scheme are analyzed and discussed. The principle of the algorithm is simple, and it is also easy to program. Hiding and extracting information are fast. The scheme could be used in many present algorithms of hiding information. The validity of the scheme is proved, and the scheme could be popularized largely.3. The paper compares the algorithm based on space with the algorithm based on frequency domain. Hiding sites, hiding formula, hiding parameter are the same, and the algorithm's robustness is tested by the experiment. According to the experiment, algorithm based on space codes easily, however, some robustness is less stronger than algorithm based on frequency domain. Among the algorithms based on frequency domain, algorithm based on DWT is the strongest than the others, which bases on DFT or DCT. However, if secret information is large, which has not any transformation. All the frequency coefficient of public image hide this information, the algorithms of frequency will be reduced robustness.