42

PIERS Proceedings, Kuala Lumpur, MALAYSIA, March 2730, 2012

Cryptography of the Medical Images

Cherif Moumen1 , Malek Benslama1 , and Mekhilef Saad2
1

Laboratoire dElectromagn etisme et de T el ecommunication, Universit e de Constantine, Alg erie 2 Department of Electrical Engineering, University of Malaya, Kuala Lumpur, Malaysia

Abstract This work presents a cryptography method that uses the properties of chaotic
systems for medical images. A chaotic algorithm of 1-D proposed by Yen and Guo, is implemented using Bit Recirculation Image Encryption (BRIE) to control the pseudo-random operations of shift that is exerted on each pixels image. Testing results between the encrypted and decrypted image and their histogram have shown the algorithm eectiveness. 1. INTRODUCTION

Nowadays, digital exchanges of medical images are frequently used throughout the world in a fraction of a second via the Internet. These data can be read or modied during their transmission via a non-controlled channel [1]. Therefore, it becomes very important to protect this private information against unauthorized viewers [2] by using cryptography. Cryptographic techniques can be divided into symmetric encryption (with a secret key) and asymmetric encryption (with private and public keys) [3]. In symmetric cryptosystems, the same key is used for the encryption or decryption and this key need to be secure and must be shared between the emitter and the receiver. These cryptosystems are very fast and easy to use [4]. In proposing specic algorithms for the transfer of medical data ensuring total privacy in parallel on the emission and receipt of data, by using 1D chaotic algorithms [5]: BRIE (Bit Recirculation Image Encryption), their basic ideas is the recirculation of bits (pixels) image in clear, so we resorted to study a simple logistic model: xn+1 = rxn (1 xn ) [6]. This chaotic system is a deterministic nonlinear dynamic system which has an unpredictable long-term [7]. This unpredictability is due to the sensitivity to initial conditions, the mixing property and the density of periodic points. This logistic model can generate chaotic binary sequences and pseudo-random, to manipulate of each pixels of the image, by the two properties confusion and diusion in classical cryptography [8]. It is a natural idea to use chaos to conceive new cryptosystems [9, 10]. Indeed, the use of this new cryptosystems in the sector of the medical sciences, with evolves in the latter years in a remarkable way, generating applications related to the use of chaos in the security communication systems, for to realize the transfer of the medical data, is the object of this work.
2. LOGISTIC MODEL

There exists many mathematical models allowing to study the growth of a population, the term population is used here in the broad sense, it can be human populations, animals, plants, people infected by virus . . . etc..
2.1. Logistic Function

New Population = growth factor (reproduction) x old population x (1 old population). xn+1 = r xn (1 xn ) (1)

To build a mathematical model, it is necessary to make hypotheses. These hypotheses play two roles [11]. 1) To preserve certain essential characteristics of reality. 2) To simplify this reality suciently so that it can to be studied by mathematics. Among these mathematical models, we will endeavour to dene the logistic function f . With f : [0, 1] [0, 1]. x0 [0, 1], xn+1 = f (xn ) with f : x r.x(1 x) (2)

Progress In Electromagnetics Research Symposium Proceedings, KL, MALAYSIA, March 2730, 2012

43

Figure 1: Evolution of the function logistic.

Figure 2: Evolution of the function logistic.

Figure 3: Evolution of the function logistic.

Figure 4: Evolution of the function logistic.

2.2. Interpretations of These Figures

Figure 1: When the rate of reproduction is weak (inferior or egal to 1), the population decreases and will tend towards zero. Figure 2: When the rate of reproduction remains moderate (between 1 and 2), a signicant population will be stabilized, around a number corresponding to half of the population that the territory could receive. Figure 3: When the rate of reproduction egual the value 3, the number of individuals of this population starts to oscillate, between two distinct values (0.64 and 0.68). Figure 4: When the rate of reproduction eguals the value 3.5, the population oscillates between four values: 0.39, then 0.83, then 0.49 and nally 0.87. The evolution of the double oscillation becomes quadruple. Figure 5: When the rate reaches 4.00, the preceding regularity disappears to leave the place to chaos. The number of individuals of the populations of the successive periods seems to oscillate irregularly, in chaotic way between the two extremes: saturation when Xn tends towards 1, and the extinction when Xn tends towards 0.
3. CHAOTIC SYSTEMS 3.1. Properties of the Chaotic Systems

The chaotic system is a dynamic deterministic system which has an unforeseeable behavior in the long term. This unpredictability is due to the sensitivity to the initial conditions, but it is too a special nonlinear system. Such a system checks the following properties: The property of the sensitivity to the initial condition, the property of mixture and density of the periodic points [12].
3.2. The Sensitivity to the Initial Conditions

In a great number of dynamic systems, a small error on the initial conditions will lead to a controllable error on the following states of the system. An example is provided in Figure 6.

44

PIERS Proceedings, Kuala Lumpur, MALAYSIA, March 2730, 2012

Figure 5: Evolution of the function logistic.

Figure 6: Represents the sensitivity to the initial conditions (Error of 0.00001).

Figure 7: Diagram of Lyapounov.

Figure 8: Diagram of Feigenbaum.

And for better quantication to the sensitivity to the initial conditions, we study the variations of the equation of Lyapounov (3), represented on the Figure 7: (x0 ) = 1 N
n

ln |r 2rxn |
k=1

(3)

The formula of Lyapounov thus makes it possible to quantify the sensitivity to the initial conditions, but it is capable of being separated by analysis, unstable behaviours and/or chaotic with stable behaviours and foreseeable, the diagram of Lyapounov is given in Figure 7: If (x) is negative or egual to zero, we are in the presence of a stable phenomenon or periodical. If (x) is positive, we are in the presence of an unstable phenomenon or chaotic.
3.3. The Capacity of Mixture

The denition of the capacity of mixture is as follows: ], [, ], [ [0; 1] , x0 ], [, n N, xn ], [ (4)

The chaotic systems have the property of the capacity of mixture, which is that of the omnipresence of the points with ergodic orbit. An orbit is known as ergodic if the whole of its elements is

Progress In Electromagnetics Research Symposium Proceedings, KL, MALAYSIA, March 2730, 2012

45

dense in [0; 1], if under open interval from [0; 1] contains a point of this orbit. Omnipresence means that if one randomly takes a point in [0; 1], it is with ergodic orbit with a probability equal to 1.
3.4. Density of the Periodic Points

The diagram of Feigenbaum (Junction) allows to better visualize the evolution of a system towards chaos by doubling of period. Imagine Y capital letter, and then add to each higher point Y four times smaller, and so on. The structure which appears directly with the glance is that of a tree structure which indicates the qualitative changes in the dynamic behavior of the quadratic function. At the quantitative level, the diagram also tells us that the branches tend progressively to become increasingly short doubling of the period; it is to be shown with each division that it corresponds in fact a doubling of the mode period of the function. Remarks on the Diagram of Feigenbaum 1. The dark zones lled of points represent a quasi innity of states in which one can nd the system. 2. Between 3.56999 and 3.7 the population uctuates inside 4 zones of attraction, then of 2. 3. From 3.7 the population varies year by year in an irregular and unforeseeable way. Nevertheless, it is only when the rate of reproduction is equal to 4 that the totality of space is lled. 4. The dark lines which form parabolas inside the chaotic extent represent the values to which the probability of nding the system is higher 5. Around 3.8 appear windows of stability in the forms of vertical white bands.
4. THE CHAOTIC ENCODING OF THE IMAGES

Due to the enormous development of the communication networks, the security of digital image returns increasingly in a signicant way and becomes necessary in several applications such as medical systems, military images and albums personals traditional techniques of encoding in real real time such as OF, RSA, IDE and Blowsh are not generally suitable because of their low speed Recently, the idea to use chaos in the encoding of the images was introduced and discussed, by several researchers [13]. Basically, there are two ways to use chaos in the eld of coding images. One, it is used to produce pseudo-random bits with the desired statistical properties with coding,the other is used to make the permutation and substitution secret necessary to the coding image (the chaotic function in 1D, 2D or 3D) This work use chaotic algorithms of 1-D, proposed by Yen and Guo. This algorithm use the logistic function f(x) = rx(1 x), where the initial condition x(0) and the parameter of control r play the role of the secret key [14]. The encryption algorithm based on BRIE use the the following rules: 1. Execution of the logistic function to produce pseudo-random binary sequences {b(i)}, from a representation of n bits of each chaotic state x(k ) such as: x(k ) = b(n k )b(n k + 1) . . . b(n k + n 1). (5)

2. Use these chaotic binary sequences {b(i)}, to control the permutations and pseudo-random substitutions of each pixel of the image.
5. CHAOTIC ALGORITHMS

There are several chaotic algorithms which handle the image (operation of coding or decoding) in block or bit with bit. These algorithms in 1-D are the base of all other algorithms: BRIE (Bit Recirculation Image Encryption). {b(i)} are used to control the pseudo-random operations of shift, exerted on each pixels image as seen in Figure 9 [15]. The version which improves BRIE is the TDCEA (The 2D Circulation Encryption Algorithm) [16]. There are several algorithms of chaotic encoding such as: CKBA (Chaotic Key-Based Algorithm). HCIE (Image Chaotique Hi erarchique Encryption). In what follows, we try to describe and analyze algorithm (BRIE).

46

PIERS Proceedings, Kuala Lumpur, MALAYSIA, March 2730, 2012

Figure 9: Structure of the algorithm BRIE.

Figure 10: The interface of the software BRIE.

Figure 11: Encoding and decoding of the images.

Figure 12: The dierence between the histogram of the original image and the histogram of the image decoding in Fig. 11.

6. ALGORITHM BRIE

The basic idea of BRIE is the recirculation of bits of the image into clear, where, it is controlled by chaotic sequences binary and pseudo random in the Figure 9. 1- The secret key of BRIE is composed by the two entireties , and the condition initial x(0) of a chaotic system [17]. Let us suppose that the clear image with a dimension of M N . M N/81 2- Execute the chaotic system to generate the chaotic orbits {x(i)}i=0 . M N 1 3- Then, to generate the pseudo-random binary sequences (PRBS) {b(i)}i=0 from the binary representation with 8 bits of x(i) = 0.b(8i + 0)b(8i + 1) . . . b(8i + 7). For each pixel into clear f (x, y ) (0 x M 1, 0 y N 1), their pixel encrypted corresponding f (x, y ) is determined by the following rules and functions:
q f (x, y ) = ROLPp (f (x, y )),

(6)

where: p = b(N x + y ) q = + b(N x + y + 1) (7) (8)

Progress In Electromagnetics Research Symposium Proceedings, KL, MALAYSIA, March 2730, 2012

47

Figure 13: Encoding and decoding of the images.

Figure 14: The dierence between the histogram of the original image and the histogram of the image decoding in Fig. 11.

q And ROLPp is it the cyclique shift by q bits in the direction controlled by p: 7 bi 2(iq+8) mod 8 , p = 0 q i =0 ROLPp (x = b7 b6 . . . b0 ) = 7 bi 2(i+q) mod 8 , p=1 i=0

(9)

The procedure of the decrypted will be:

q 8q f (x, y ) = ROLP1 (f (x, y )) p (f (x, y )) = ROLPp

(10)

7. APPLICATIONS (ALGORITHM BRIE)

To check and clarify the analysis above, we provide some experimental results in this section. We use the logistic function like the chaotic system with the following key of encrypted: = 1, = 4 and the initial condition x0 = 0.10001. Let us select the images of the Bmp type of 256 256 colors and 24 bits, this chaotic algorithm can be established in the form of an encrypted software with the key of encrypted which is identical to the key of decrypted Figure 10. The Figures 11 and 13 represent the results of the chaotic software. The encrypted and decrypted images and their histograms show that: The concentrations of the original images are dierent from one level of gray to another, and the frequency of apprearance of the various levels of gray which compose them. The decrypted images are identical by contribution to the original images, example in the Figure 11, the histogram of the original image is identical only to the decrypted image with the same maximum value of gray 2004, and the dierence between them is negligible (represented by a maximum value of gray equals to 3 front 2004 Figure 12), and completely identical on the Figure 14. The levels of gray for the original images are concentrated on places narrow and not on the range (0, . . . , 255).
8. CONCLUSION

A chaotic system is sensitive to the initial conditions, and it is thus a fundamental characteristic of chaos, and it magnies even the smallest errors (ex: 0.00001). This signies that: if one changes

48

PIERS Proceedings, Kuala Lumpur, MALAYSIA, March 2730, 2012

the starting state, one expects the general evolution of the system to be modied. Therefore this characteristic is exploited by: The cryptography in general and the chaotic cryptography in particular generate the keys of coding/deciphering, for example 0.1 and 0.10001 are two completely dierent keys. Chaos with these characteristics found a very important applicability in cryptography, and created their own interval called: Chaotic cryptography. We can start a chaotic phenomenon by a generator through respecting the properties of chaos. Since the traditional algorithms are not recommended to encipher the medical images because they are slow, we can associate the properties of traditional cryptography which are substitution and transposition with the properties of a chaotic system to solve the problems of traditional cryptography. As we see in this paper. Chaotic cryptography is a new method to encipher the medical data, and particularly medical imageries, where the data are voluminous, and cannot be enciphered with traditional algorithms such DES and RSA. Thus, the idea to make use of the chaotic systems became essential. The complexity to keep the generation and the storage of the keys of encoding/decoding secretly in the traditional systems become useless in chaotic cryptography. This software can be implemented in the medical systems for the ling and the transfer of the medical data.
REFERENCES

1. Jose Marconi, A. and M. Rodrigues, Transfert securise dimages par combinaison de techniques de compression et cryptage, These de Doctorat de Luniversite de Montpellier II, Oct. 2006. 2. Bruce, S., Cryptographie appliquee, Vuibert, 2nd Edition, 2001. 3. Anane, N., M. Anane, H. Bessalah, M. Issad, and K. Messaoudi, RSA based encryption decryption of medical images, Systems Signals and Devices (SSD), 2010. 4. Mollin, R. A., RSA and Public-key Cryptography (Discrete Mathematics and Its Applications, 1st Edition, Nov. 12, 2002. 5. Larger, L. and J. P. Goedgebuer, Dynamiques chaotiques appliqu ees ` a la cryptographie, Laboratoire Doptique P. M., Universit e de France, Comt e, 2003. 6. Moumen, C., Etude dun mod` ele logistique pour elaborer un algorithme de cryptage chaotique, Th` ese de Magist` ere, Universit e de Constantine, 2005. 7. Raband, S. N., Chaotic dynamics of nonlinear systems, Wiley, 1990. 8. Schneier, B., Cryptographie Appliqu ee; Algorithmes, et Code Source en C, 2nd Edition, 2001. 9. Vandewalle, D., Le chaos politique, Th` ese DEA, U.C.L Louvain la Neuve, Belgique, 1997. 10. Furht, B. and D. Kirovski, Multimedia Security Handbook, Feb. 5, 2004. 11. Kosmelj, K. and K. Vadnal, Comparison of two generalized logistic regression models; a case studyInformation, Technology Interfaces, 2003. 12. Stork, M., Digital chaotic systems examples and application for data transmission, Electrical and Electronics Engineering, 2009. 13. Wang, H., K. Ding, and C. Liao, Chaotic watermarking scheme for authentication of JPEG images, Biometrics and Security Technologies, 2008. 14. Belkhouche, F. and U. Qidwai, Binary image encoding using 1D chaotic maps, IEEE Region 5, Annual Technical Conference, 2003. 15. Sobhy, M. I. and A.-E. R. Shehata, Chaotic algorithms for data encryption, Acoustics, Speech, and Signal Processing, 2001.