Digital Image Scrambling Arithmetic That Based On Three-dimensional Mapping

Now, the network technology developed like a volcanic eruption, the functionof network messaging is more and more important in people’s work, study and life.However, due to the openness of the network, the message on the network alwaysfaced with various malicious attacks. These malicious attacks can cause informationto be destroyed, changed, or leak, and a huge loss to the legitimate user. Therefore,information security technology is becoming a hot issue in computer applications.Digital image has a lot of weight for all network message. Because of the natureof huge amount of information and often contains sensitive private information, thesecurity of digital image information become more and more important for the user,and become an important problem of information encryption.Because of two-dimensional digital image shows information by the grayrelationship of adjacent pixels, the pixels of "valuable" digital images are notindependent and have large correlation. So, if disrupting the location of these pixels,we can make the digital image lost its meaning and achieve the purpose of hidingimage information. So, an effective mode of digital image’s encryption is imagescrambling.According to the discussing of the digital image encryption technology, we putforward two kinds of scrambling method. They are respectively based on the threedimensional Henon and Duffing mapping. In this paper, all of the two algorithms areimprove the two-dimensional mappings to three-dimensional mappings, and use theinitial value sensitivity and pseudo randomness of chaotic mapping to achieve thegoal of image scrambling. The test makes clear that the image scrambling methodhas dependencies on key. If we know nothing about the key, it is very hard to gainthe original image. The two new methods have good robustness for many attacks.