Chaos-Based Image Encryption Using an Improved Quadratic Chaotic Map
|
|
- Jasper Barrett
- 6 years ago
- Views:
Transcription
1 America Joural of Sigal Processig 26, 6(): -3 DOI:.5923/j.ajsp.266. Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map Noha Ramada,*, Hossam Eldi H. Ahmed, Said E. Elkhamy 2, Fathi E. Abd El-Samie Commuicatio, Faculty of Electroic Egieerig, Meofia Uiversity, Egypt 2 Electrical Egieerig, Faculty of Egieerig, Alexadria Uiversity, Egypt Abstract I recet years, chaos-based image ecryptio has become a efficiet way to ecrypt images due to its high security. I this paper, we improve the classical Quadratic chaotic map to ehace its chaotic properties ad use it for image ecryptio. Compared with the classical Quadratic map, the proposed Quadratic map demostrates better chaotic properties for ecryptio such as a much larger maximal Lyapuov expoet. The proposed image ecryptio scheme is based o two chaotic maps. The first map is the Chepyshev chaotic map, which is used for the permutatio of the pixels of the image. The permuted image is subjected to the diffusio process usig the improved Quadratic map i a efficiet ecryptio algorithm which its key is related to the origial image. The mai advatages of the proposed scheme are the large key space ad its resistace to various attacks. Simulatio results show that the proposed scheme has a high security level with low computatioal complexity, which makes it suitable for real-time applicatios. Keywords Chaos ecryptio, Quadratic map, Chepyshev, Lyapuov expoet. Itroductio I recet years, the trasmissio of a large amout of data such as video cofereces, medical ad military images over commuicatio media was highly developed. The security of iformatio trasmitted is a vital issue. Most covetioal secure ciphers such as Data Ecryptio Stadard (DES) [] ad Advaced Ecryptio Stadard (AES) [2] are ot suitable for fast ecryptio of a large data volume i real time. The implemetatio of traditioal algorithms for image ecryptio is eve more complicated because of the high correlatio betwee image pixels. Therefore, there is still a lot of work to be doe for the developmet of sophisticated ecryptio methods. May researchers have poited out the existece of a strog relatioship betwee chaos ad cryptography. The idea of usig chaos i cryptography ca be traced back to Shao o secrecy systems [3]. Although the word "chaos" was ot mited till the 97s [4], the use of chaos i cryptography seems quite atural. The two basic properties of a good cipher; cofusio ad diffusio are strogly related to the fudametal characteristics of chaos such as a broadbad spectrum, ergodicity ad high sesitivity to iitial coditios. The implemetatio of Shao's idea had to wait till the developmet of chaos theory i the 98s. * Correspodig author: eg_oharamada@yahoo.com (Noha Ramada) Published olie at Copyright 26 Scietific & Academic Publishig. All Rights Reserved I the first scietific paper o chaotic cryptography that appeared i 989, Matthews [5] came up with the idea of a stream cipher based o oe-dimesioal chaotic map. Afterwards, chaotic cryptography has spread ad more papers about digital chaotic ciphers have bee published [6-8]. Traditioally, ecryptio is based o discrete umber theory, so that data has to be digitized before ay ecryptio process ca take place. I order to ecrypt a cotiuous voice or a video i the old fashio, digitalizatio ad ecryptio ca pose a heavy computatioal process. The use of chaotic commuicatio eables to ecrypt the message waveform without a eed to digitalize it [9]. Based o stregths ad weakesses of already existig algorithms, Kelber ad Schwarz formulated several geeral rules to desig a good chaos-based cryptosystem [9-]: Either use a suitable chaotic map, which preserves importat properties durig discretizatio for block cipher or use a balaced combiig fuctio ad a suitable key-stream geerator for a stream cipher. Use a large key space. Avoid simple permutatios of idetical system parameters. Use the same precisio for sub-key values ad their correspodig system parameters. Use a complex iput key trasformatio. Use a dyamical system. Use complex oliearities. Modify oliearities i terms of key ad sigal values.
2 2 Noha Ramada et al.: Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map Use several rouds of operatio for block ciphers. The basic properties of chaotic systems are the determiisticity, the sesitivity to iitial coditios ad parameters ad the ergodicity. Determiisticity meas that chaotic systems have some determiig mathematical equatios rulig their behavior. The sesitivity to iitial coditios meas that whe a chaotic map is iteratively applied to two iitially close poits, the iteratios quickly diverge, ad become ucorrelated i the log term. Sesitivity to parameters causes the properties of the map to chage quickly, whe slightly disturbig the parameters, o which the map depeds. Hece, a chaotic system ca be used as a pseudo-radom umber geerator. The ergodicity property of a chaotic map meas that if the state space is partitioed ito a fiite umber of regios, o matter how may, ay orbit of the map will pass through all these regios. A umber of traditioal chaotic maps such as Quadratic map [] ad Logistic map [2] have limited properties ad may o loger satisfy our eeds. Without improvemet of chaotic maps, our applicatios will remai uchaged ad might be subject to differet attacks i the future. Hece, there is a bad eed for more improvemets i the chaotic maps. I this paper, a improved Quadratic chaotic map is first itroduced. We use the maximal Lyapuov expoet [3] ad the bifurcatio diagram to determie the performace of the map. A ew image ecryptio scheme based o this improved Quadratic map is preseted cotaiig two mai processes; permutatio ad diffusio. The permutatio process breaks the strog relatioship betwee adjacet pixels. The permutatio operatio oly shuffles the pixel positios without chagig values. The shuffled ad origial images have the same etropy, ad therefore the shuffled image is weak agaist statistical attack ad kow plai-text attack. I the diffusio process, the pixel values are altered. Most researchers focus o security improvemets [4-5], while oly a few are dealig with efficiecy issues [6-7]. For most of the security improvemets, researchers eed at least three rouds of the diffusio process to obtai a satisfactory performace. Researchers focusig o efficiecy improvemet oly eed oe roud of the diffusio process to achieve the high security level ad speed up the performace. However, some of the proposed algorithms lead to a loger processig time i a sigle roud. Therefore, the key problem of desigig a efficiet image cryptosystem is how to reduce the computatioal complexity with efficietly to avoid the large umber of rouds i the geeratio of diffusio ad permutatio keys ad the achieve high speed performace. At the permutatio step, we sort the chaotic sequeces of the Chepyshev map i order to shuffle the etire image. At the diffusio step, the shuffled image is ecrypted with a key related to plai image. 2. Aalysis of Quadratic Map Quadratic map is a basic example of a chaotic system. The equatio of the classical Quadratic map is [8]: x + = r ( x ) 2 () where r is the chaotic parameter ad is the umber of iteratios. The system of the Quadratic map is chaotic, because it is oliear. It is determiistic sice it has a equatio that determies the behavior of the system. Also, a very slight chage of the iitial value x ca lead to a sigificatly differet behavior of the map. I the followig subsectios, may plots for the aalysis of the Quadratic chaotic map will be studied such as the iteratio property, the bifurcatio diagram, ad the Lyapuov expoet. 2.. Iteratio Property The iteratio diagram plots the relatio betwee the umber of iteratios ad the Quadratic chaotic map at differet values of the chaotic parameter r ad at a specific iitial value x. The parameter r ca be divided ito three regios, which ca be examied by simulatio usig MATLAB as followig: Whe r [,.74], as show i Fig. (a), the calculated value come to the same result after several iteratios without ay chaotic behavior. Whe r [.74,.5], as show i Fig. (b), the system appears as havig a periodic behavior. Whe r [.5, 2], it becomes a chaotic system as show i Fig. (c) Bifurcatio Diagram Bifurcatio is usually referred to as the qualitative trasitio from regular to chaotic behavior by chagig the cotrol parameter. The bifurcatio diagram is used to study the chaotic system as a fuctio of the values of the cotrol parameters. This diagram allows kowig the regios of the system displayig covergece, bifurcatio, ad chaos depedig o the values of the cotrol parameters [9]. Fig. (d) shows the bifurcatio diagram of the classical Quadratic map. This diagram has three regios. The covergece regio is at r [,.74]. The bifurcatio regio is at r [.74,.5]. The chaos regio is at r [.5, 2], where the chaotic behavior occurs Lyapuov Expoet Lyapuov expoet represets the features of a chaotic system ad ca largely express the overall performace of chaotic maps. It is used as a quatitative measure for the sesitive depedece o iitial coditios. For a discrete system x + =f(x ) ad for a orbit startig with x, the Lyapuov expoet ca be defied as follows [2-2]: λ (x ) = lim i= l f (xi) (2) where f is the derivative of the fuctio f. If λ is egative,
3 Lyapuov expoet X+ X+ X+ America Joural of Sigal Processig 26, 6(): -3 3 the system is ot chaotic. If λ is zero, this meas that the system is eutrally stable ad is i steady state mode. If λ is positive, the evolutio is sesitive to iitial coditios ad therefore chaotic. Also, it is commo to refer to the largest defied by Eq.(2) as the Maximal Lyapuov Expoet (MLE), because it determies a otio of predictability for a chaotic system. The larger MLE is, the more chaotic the map is ad the smaller the umber of iteratios ecessary to achieve the required degree of diffusio or cofusio of iformatio is, ad this meas a better chaotic map. Fig. (e) shows the Lyapuov expoet of the classical Quadratic map. It is obviously clear that whe r [,.5], all Lyapuov expoets are less tha or equal to zero. Whe r [.5,2], the Lyapuov expoets are positive, ad hece chaotic. The maximal Lyapuov expoet of the Quadratic map is The Proposed Quadratic Map The equatio of the proposed quadratic map is: X + = (r+ (-ax ) 2 ) mod (3) We will replace -(x ) 2 i Eq.() with the term (-ax ) 2 ad module. Now, we will examie the proposed Quadratic maps ad plot the iteratio property, bifurcatio diagram, ad Lyapuov expoet at three differet values of r =.25 a = 2, 4, Aalysis of the Proposed Quadratic Map The equatio of the proposed Quadratic map at a= 2 is: X + = (r+ (-2x ) 2 ) mod (4) Fig. 2 shows the aalysis of the proposed Quadratic map. From Fig. 2 (a), (b), (c), ad (d), it is clear that there are several covergece, bifurcatio, ad chaos regios. These regios are exteded to ifiity. The bifurcatio regios are at r [.5,.3], r [.5,.3], etc. to ifiity. The covergece regios are at r [.3,.56], r [.2,.56], etc. to ifiity. The chaos regios are at r [,.4], r [.56, 2.4], r [2.56,3.4], etc. to ifiity, where the chaotic behavior occurs. Now, it is obvious that the chaotic rage of the proposed Quadratic map is larger tha the chaotic rage for the classical oe, ad hece this will icrease the available chaotic value of parameter r that ca be used i ecryptio. I Fig. 2 (e), the Lyapuov expoet has a positive value at r [,.4], r [.56,2.4], r [2.56,3.4], etc, ad hece the proposed Quadratic map exhibits a chaotic behavior at these periods. The MLE of the proposed Quadratic map is.6732, which is greater tha the classical Quadratic map but still small. r =.8 r = (a) Iteratio property at r=.25. (b) Iteratio property at r=.8. (c) Iteratio property at r= r (d) Bifurcatio diagram. (e) Lyapuov expoet. Figure. Aalysis of the classical Quadratic map at x =.2
4 Lyapuov expoet X+ X+ X+ 4 Noha Ramada et al.: Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map r = r =.25 r = (a) Iteratio property at r=. (b) Iteratio property at r=.25. (c) Iteratio property at r= r (d) Bifurcatio diagram. (e) Lyapuov expoet. Figure 2. Aalysis of the proposed Quadratic map at x = Aalysis of the Proposed Quadratic Map 2 The equatio of the proposed Quadratic map 2 at a= 4 is: X + = (r+ (-4x ) 2 ) mod (5) Fig. 3 shows the aalysis of the proposed Quadratic map 2. From Fig. 3 (a), (b), (c), ad (d), it is clear that the covergece ad bifurcatio regios have become very small ad chaos regios are icreased. These regios are exteded to ifiity. The bifurcatio regios are at r [.38,.4], r [.7,.9], r [.38,.4], r [.7,.9] etc. to ifiity. The covergece regios are at r [.2,.266], r [.2,.266], etc. to ifiity. The chaos regios are at r [,.37], r [.4,2.4], r [.4, 3.4], etc. to ifiity, except the small regios of covergece ad bifurcatio, where the chaotic behavior occurs. I Fig. 3 (e), the Lyapuov expoet has a positive value at all values of r except small rages of covergece ad bifurcatio. Hece, the proposed Quadratic map 2 exhibits a chaotic behavior i the rest of the rage. The MLE of the proposed Quadratic map 2 is 2.257, which is much greater tha the classical Quadratic map ad proposed Quadratic map Aalysis of the Proposed Quadratic Map 3 The equatio of the proposed Quadratic map 3 at a= 8 is: X + = (r+(-8x ) 2 )mod (6) Fig. 4 shows the aalysis of the proposed Quadratic map 3. From Fig. 4 (a), (b), (c), ad (d), it is clear that the proposed Quadratic map 3 exhibits a chaotic behavior at all values of r except the values.,., etc. to ifiity. I Fig. 4 (e), the Lyapuov expoet has a positive value at all values of r except the values of.,., etc. So, the proposed Quadratic map 3 exhibits a chaotic behavior at the rest of the rage. The MLE of the proposed Quadratic map 3 is 3.479, which is much greater tha the classical Quadratic map ad the proposed Quadratic map ad 2. Table () summarized the aalysis of the classical ad proposed quadratic maps. It shows the improvemet i both the chaotic parameter rage r ad MLE.
5 Lyapuov expoet X+ X+ X+ Lyapuov expoet X+ X+ X+ America Joural of Sigal Processig 26, 6(): -3 5 r = r =.8 r = (a) Iteratio property at r=. (b) Iteratio property at r=.8. (c) Iteratio property at r= (d) Bifurcatio diagram r (e) Lyapuov expoet. Figure 3. Aalysis of the proposed Quadratic map 2 at x =.2 r = 2 r =. r = (a) Iteratio property at r=. (b) Iteratio property at r=.. (c) Iteratio property at r= (d) Bifurcatio diagram r (e) Lyapuov expoet. Figure 4. Aalysis of the proposed Quadratic map 3 at x =.2
6 Lyapuov expoet 6 Noha Ramada et al.: Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map Table (). Compariso betwee the classical ad proposed Quadratic maps Chaotic map Equatio Chaotic parameter rage MLE Classical Quadratic Map X + = r (x ) 2 r [.4, 2].672 Proposed Quadratic Map X + = (r+(-2x ) 2 )mod r [,.4], r [.56, 2.4], r [2.56,3.4] to.6732 Proposed Quadratic Map 2 X + = (r+(-4x ) 2 )mod r [,.37], r [.4, 2.4], r [.4,3.4] to Proposed Quadratic Map 3 X + = (r+(-8x ) 2 )mod All values to except (r=.,.,etc ) Applicatio o Image Ecryptio Now, we will itroduce the proposed image ecryptio scheme based o two chaotic maps; the Chepyshev map ad the proposed Quadratic maps we have just costructed. 4.. Chepyshev Chaotic Map The Chepyshev chaotic map is a oe dimesioal chaotic system with oe iitial coditio x ad oe cotrol parameter k ad ca be described as follows [22]: y + =cos (k cos - (y )) (7) where y [, ] for =,,2, ad k [2, ). The bifurcatio diagram of the Chepyshev map i Fig. 4 shows that all the (y, k) where y [-, ] ad 2 k < ca be used as secret keys. The Chepyshev map has a positive icreasig Lyapuov expoet at k >= 2, ad thus, it is always chaotic as show i Fig The Permutatio Process We use Chepyshev chaotic map to geerate chaotic sequeces x ad the sort that chaotic umbers i ascedig or descedig order for the geeratio of the permutatio key. For a 256-level gray-scale image, y =.97 ad k= We sort the chaotic sequeces i the idex matrix used i shufflig the origial image to obtai the permuted image. The origial Camerama image ad the permuted image after permutatio are show i Fig. 7 ad Fig. 8. After obtaiig the shuffled image, the correlatio amog the adjacet pixels is completely disturbed ad the image is completely urecogizable. The histogram of the permuted image ad the origial image are the same, sice there is o chage i the itesity of pixels as show i Fig. 9 ad Fig.. Therefore, the permuted image is weak agaist statistical attack, ad kow plai-text attack. As a result, we employ a diffusio process after permutatio to improve the security. Figure 4. Bifurcatio diagram of the Chepyshev chaotic map at x =.2 Figure 7. Origial image k Figure 5. Lyapuov expoet of the Chepyshev chaotic map Figure 8. Permuted image
7 America Joural of Sigal Processig 26, 6(): Figure 9. Histogram of the origial image Figure. Histogram of the permuted image 4.3. Image Diffusio Based o the Proposed Quadratic Chaotic Maps The diffusio step i the proposed ecryptio scheme is performed by the key related to the plai image algorithm which used oly oe roud diffusio operatio ad its key depeds o the iitial key ad the origial image [23]. We will use the proposed Quadratic maps ad also the classical Quadratic map i the diffusio process ad compare betwee them. After compariso, we will get the chaotic map which has the best performace. We will treat the image as a oe dimesioal vector im = {im, im 2 im L } of legth L= M N. The iitial value x =.2. We will discuss the ecryptio process oly, because the decryptio is the reverse process. The details of the ecryptio process ca be summarized as follows: Step : for =, iterate the classical ad proposed Quadratic maps usig Eqs. (), (4), (5) ad (6) for oly oe time to get x. Step 2: modify x accordig to the followig equatio, where im is ay arbitrary image pixel. x = mod (x + (im + )/255,) (8) Step 3: for =+ retur to step util =L to get x L. Let the ew iitial value of the proposed Quadratic map 3 be (x +x L )/2. Step 4: iterate the proposed Quadratic map 3 usig Eq. (8) for L times with the ew iitial value. The, we obtai the sequece. X = x L+, x L+2,, x 2L (9) Step 5: to get the sequece K= {k, k 2,,K L } use k = mod floor x L+ 5, 256 () Where =, 2,.., L Step 6: examie the radomess of the sequece k : H = rustest(k ) () By usig the Matlab fuctio (rustest) for radomess, H returs () if the sequece is radom ad () if ot. I our case, H=. Step 7: compute the first cipher pixel by usig the value of im, the costat c, ad the first key k. c = k mod im + c, 256 (2) Step 8: let =+ Step 9: compute the th pixel of the cipher image by usig the followig equatio i which the cipher output feedback is itroduced. c = k mod im + im, 256 (3) Step : repeat step 8 ad step 9 util reaches L, ad the the cipher image C= {c, c 2,,c } is obtaied. 5. The Proposed Scheme The proposed ecryptio scheme is based o a permutatio-diffusio architecture. The first stage is applyig the permutatio process to the origial image. The, the permuted image is subjected to the diffusio process. The permutatio is achieved usig Chepyshev map. The diffusio process is achieved by the key related to the plai image algorithm based o the proposed Quadratic maps we have just costructed. The decryptio process is simply the reverse of the ecryptio process. See Fig.. 6. Performace Aalysis The quality of the ecryptio algorithm is its ability to resist differet kids of kow attacks such as kow/chose plai-text attack, cipher-text oly attack, statistical attack, differetial attack, ad various brute-force attacks. We will examie the proposed algorithm by measurig security, statistical, ad sesitivity aalysis o differet images. 6.. Security Aalysis 6... Key Space Aalysis The key space is the total umber of differet keys that ca be used i the ecryptio process. The proposed algorithm cosists of two processes; permutatio ad diffusio. I the permutatio process, we use Chepyshev map with two idepedet variables y ad k. I the diffusio process, the Quadratic map has two idepedet variables x ad r. I the key related to the plai text algorithm, we have a costat
8 8 Noha Ramada et al.: Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map iteger c ad c [, 255]. As a result, the key space is {y, k, x, r, c}. Sice y, k, x ad r are double precisio umbers, the total umber of differet values for y, k, x ad r is more tha 4. So, the key space is larger tha This large key space is eough to resist brute-force attack. O the other had, the key space of RC6, DES ad chaotic Baker map for the same 256 level gray-scale image is 2 28, 2 56, ad 2 63 respectively [24]. See Table (2) Table (2). The key space compariso The ecryptio scheme The key space The proposed hybrid chaotic scheme RC DES 2 56 Chaotic Baker map Statistical Aalysis I order to prove the security of the proposed ecryptio algorithm, the followig statistical tests are performed. (a) Histogram Histogram clarifies that how pixels i a image are distributed by plottig the umber of pixels at each gray-scale level. The histogram of the origial Camerama, Madrill ad Lea images ad their ecrypted versios with the classical Quadratic map, the proposed Quadratic map, 2 ad 3 are show i Figs. 2, 3 ad 4. These figures show that the histograms of the ecrypted images of all Quadratic maps are fairly uiform ad completely differet from those of the origial images. (b) Correlatio Coefficiet For a origial image, adjacet pixels have a large correlatio. For a ecrypted image, the correlatio betwee pixels should be as small as possible. The closer the value of correlatio coefficiet (CC) to zero, the better is the ecryptio. If the correlatio coefficiet equals zero, the the origial image ad its ecrypted versio are totally differet. So, the success of the ecryptio process meas smaller values of the correlatio coefficiet. The CC is measured by the followig equatio [25]: CC N i ( x E( x))( y E( y)) i N 2 N 2 x i E x y i i i E y ( ( )) ) ( ( )) ) N Where ( E( x) x i i ) (4) N where x ad y are the gray-scale pixel values of the origial ad ecrypted images. Table (3) shows the CC of the proposed scheme usig the classical ad proposed Quadratic maps, RC6, DES ad chaotic Baker map for differet test images. The simulatio results show that all the ecryptio algorithms listed have a very small CC, ad the proposed scheme based o the proposed Quadratic map 3 has the best CC. (c) Maximum Deviatio The Maximum Deviatio (MD) measures the quality of the ecryptio i terms of how it maximizes the deviatio betwee the origial ad the ecrypted images [26]. The higher the value of MD, the more the ecrypted image is deviated from the origial image. Table (3) shows that the MD of the proposed scheme based o the proposed Quadratic map 3 is the highest compared to the classical ad the proposed Quadratic maps, 2. The DES has the best MD for Camerama image, oly. The worst result of this test was foud i the chaotic Baker chaotic with a result of zero, because this algorithm depeds oly o permutatio. (d) Irregular Deviatio The Irregular Deviatio (ID) is based o how much the deviatio caused by ecryptio is irregular [27]. The lower the ID value, the better the ecryptio algorithm. Table (3) shows that the ID of the proposed scheme with the proposed Quadratic map 3 has the smallest value for all tested images. i Origial Image Decrypted Image Permutatio (Chepyshev Map) Re-orderig (Chepyshev Map) Diffusio (Proposed Quadratic Map) (Proposed Quadratic Map) Decryptio Ecrypted Image Figure. The proposed scheme
9 America Joural of Sigal Processig 26, 6(): (a) Origial Camerama image. (b) Histogram of origial Camerama image. (c) Ecrypted Camerama image usig the classical Quadratic map. (d) Histogram of a ecrypted Camerama image usig the classical Quadratic map (e) Ecrypted Camerama image usig the proposed Quadratic map. (f) Histogram of a ecrypted Camerama image usig the proposed Quadratic map. (g) Ecrypted Camerama image usig the proposed Quadratic map 2. (h) Histogram of a ecrypted Camerama image usig the proposed Quadratic map (i) Ecrypted Camerama image usig the proposed Quadratic map 3. (j) Histogram of a ecrypted Camerama image usig the proposed Quadratic map 3. Figure 2. Camerama image ecryptio with the classical ad proposed Quadratic maps (a) Origial Madrill image. (b) Histogram of origial Madrill image. (c) Ecrypted Madrill image usig the classical Quadratic map. (d) Histogram of a ecrypted Madrill image usig the classical Quadratic map (e) Ecrypted Madrill image usig the proposed Quadratic map. (f) Histogram of a ecrypted Madrill image usig the proposed Quadratic map. (g) Ecrypted Madrill image usig the proposed Quadratic map 2. (h) Histogram of a ecrypted Madrill image usig the proposed Quadratic map 2.
10 Noha Ramada et al.: Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map (i) Ecrypted Madrill image usig the proposed Quadratic map 3. (j) Histogram of a ecrypted Madrill image usig the proposed Quadratic map 3. Figure 3. Madrill image ecryptio with the classical ad proposed Quadratic maps (a) Origial Lea image. (b) Histogram of origial Lea image. (c) Ecrypted Lea image usig the classical Quadratic map. (d) Histogram of a ecrypted Lea image usig the classical Quadratic map (e) Ecrypted Lea image usig the proposed Quadratic map. (f) Histogram of a ecrypted Lea image usig the proposed Quadratic map. (g) Ecrypted Lea image usig the proposed Quadratic map 2. (h) Histogram of a ecrypted Lea image usig the proposed Quadratic map (i) Ecrypted Lea image usig the proposed Quadratic map 3. (j) Histogram of a ecrypted Lea image usig the proposed Quadratic map 3. Figure 4. Lea image ecryptio with the classical ad proposed Quadratic maps
11 America Joural of Sigal Processig 26, 6(): -3 Table (3). CC, MD, ID ad processig time of RC6, DES, Baker ad all Quadratic maps for Camerama, Madrill ad Lea images Camerama image The ecryptio scheme CC MD ID Processig time Classical Quadratic map Sec Proposed Quadratic map Sec Proposed Quadratic map Sec Proposed Quadratic map Sec RC Mis DES Sec Chaotic Baker map Sec Madrill image Classical Quadratic map Sec Proposed Quadratic map Sec Proposed Quadratic map Sec Proposed Quadratic map Sec RC Mis DES Sec Chaotic Baker map Sec Lea image Classical Quadratic map Sec Proposed Quadratic map Sec Proposed Quadratic map Sec Proposed Quadratic map Sec RC Mis DES Sec Chaotic Baker map Sec Sesitivity Aalysis I geeral, a ecrypted image must be sesitive to the small chages i the origial image ad secret key. I order to avoid differetial attack, a small chage i the plai image or secret key should cause a sigificat chage i the ecrypted image. Two parameters were used for differetial aalysis; Net Pixel Chage Rate (NPCR) ad Uified Average Chagig Itesity (UACI) [28]. NPCR measures the umber of pixels chage rate of ecrypted image while oe pixel of the origial image is chaged. UACI measures the average itesity of the differeces betwee those two images. The NPCR ad UACI of two ecrypted images are defied i Eqs. (5), (6) respectively. C ad C2 are two ecrypted images, whose correspodig plai images have oly oe pixel chage. NPCR D ( i, j ) i, j % W H C ( i, j) C ( i, j) UACI W H 255 (5) 2 % (6) i, j where D(i,j) represets the differece betwee C(i,j) ad C2(i,j). If C(i,j)= C2(i,j) the D(i,j)=, otherwise D(i,j)=. We ca use these two parameters to measure the key sesitivity as follows. (a) Key Sesitivity We obtaied the NPCR ad UACI of the ecrypted Camerama image uder the chage of the value of x ad r, o which the secret key depeds. We used x =.2 ad r= 2 as the first set of key, ad the chaged it. Table (4) shows the values of NPCR ad UACI betwee ecrypted images with keys (x, r) ad aother slightly differet key (Δx, Δr). Our results show that for all ecryptio algorithms with classical ad proposed Quadratic maps, more tha 99% of the pixels i the ecrypted image chage their gray values, whe the key is just chaged by -4. The ecryptio algorithm with the proposed Quadratic map 3 has the highest chage rate. This meas that the proposed scheme provides high key sesitivity. For a 256 gray-level image, the expected UACI value is 33% ad the proposed scheme has a UACI value equal to %. Furthermore, the proposed scheme has the best results for NPCR ad UACI amog RC6, DES ad chaotic Baker map ecryptio algorithms.
12 2 Noha Ramada et al.: Chaos-Based Image Ecryptio Usig a Improved Quadratic Chaotic Map Table (4). NPCR ad UACI betwee ecrypted Camerama images The ecryptio scheme Classical Quadratic map Proposed Quadratic map Proposed Quadratic map 2 Proposed Quadratic map 3 RC6 DES Chaotic Baker map 6.2. Processig Time Keys Δx = -4, Δr= NPCR UACI Δx =, Δr= Δx = -4, Δr= Δx =, Δr= Δx = -4, Δr= Δx =, Δr= Δx = -4, Δr= Δx =, Δr= The processig time is the time required to ecrypt ad decrypt a image. The smaller the processig time, the better is the ecryptio efficiecy. The proposed scheme uses oly oe roud for diffusio process, ad so this reduces the ecryptio/decryptio time, ad hece the scheme is practicable i real time applicatios. All the calculatios are performed usig MATLAB R27a software uder widows XP operatig system, processor core 2 duo,.6 GHz ad 2G RAM. For the 256 gray level Camerama, Madrill, ad Lea images, the processig time is listed i Table (3). It is clear that the processig time of the proposed scheme is withi 75 secods, which is smaller tha the processig time of RC6, ad DES. Chaotic Baker map has the smallest processig time, because it is just a permutatio map. 7. Coclusios I this paper, ew Quadratic chaotic maps with better chaotic properties have bee proposed. These maps icrease the available chaotic rage of parameter r to ifiity, ad hece are more robust agaist attacks compared to the limited value of parameter r i the classical Quadratic map. The MLE i the proposed Quadratic maps is icreased compared to the classical Quadratic map up to 3.479, while it was.672 i the classical Quadratic map. Therefore, the proposed Quadratic maps are more effective tha the classical Quadratic map i the ecryptio process ad more sesitive to the iitial coditios. A ecryptio scheme of permutatio ad diffusio combiig two chaotic maps has bee preseted ad ivestigated. I the permutatio process, we sort chaotic sequeces of the Chepyshev map to shuffle the image. This procedure avoids the cycle of chaotic umbers i the geeratio of the permutatio key. I the diffusio process, the permuted image is the ecrypted by the key related to the plai image algorithm usig the proposed Quadratic maps. I this ecryptio scheme, the key depeds o both the iitial key ad the origial image. So it ca survive kow plai text attack. This algorithm uses a sigle roud of diffusio, ad hece it has low computatioal complexity. The proposed ecryptio scheme effectively resists the brute-force attack due to its very large key space. Furthermore, security, statistical, ad sesitivity aalysis has bee carried out demostratig high security ad robustess of the proposed scheme. This proposed scheme is suitable for real-time image ecryptio applicatios due to its small processig time compared to the other ecryptio schemes. A comparative study have bee preseted betwee the proposed scheme, RC6, DES ad chaotic Baker map. The results of this compariso show that the proposed scheme usig the proposed Quadratic maps has a superior performace. REFERENCES [] E B William, (2), Data Ecryptio Stadard, i NIST's athology, A Cetury of Excellece i Measuremets Stadards ad Techology: A Chroicle of Selected NBS/NIST Publicatios. [2] FIPS PUB 97, (2), Advaced Ecryptio Stadard (AES), Natioal Istitute of Stadards ad Techology, U.S. Departmet of Commerce. [3] C.E. Shao, Commuicatio Theory of Secrecy Systems, Bell System Techical Joural, vol. 28, No. 4, pp , October 949. [4] Li, T.Y., Yorke, J.A. Period three implies chaos. The America Mathematical Mothly 82, 985{992 (975). [5] Matthews, R. Cryptologia 989, XIII, [6] Habutsu, T.; Nishio, Y.; Sasase, I.; Mori, S., Advacesicryptology-Eurocrypt 9, Lecture otes i computers ciece 547, Pp.27-4, Spiger-Verlag, Berli, 99. [7] Fridrich, J. It. J. Bifurcatio ad Chaos 998, 8, [8] Baptista, M. S. Phys. Lett. A 998, 24, [9] Alexader N. Pisarchik, Massimiliao Zai, Chaotic map cryptography ad security I: Ecryptio: Methods, Software ad Security Editor: Editor Name, pp. -28, 2 Nova Sciece Publishers, Ic. [] Kelber, K.; Schwarz, W. NOLTA 25, Bruges. [] Fial_Report/quadraticmap.pdf [2] S Li, (27), Aalyses ad ew desigs of digital chaotic ciphers, Ph.D. dissertatio, iformatio ad commuicatios egieerig, Xi a Jiaotog Uiveristy, Chia. [3] M. T. Rosestei, J. J. Collis, ad C. J. de Luca, (993), A practical method for calculatig largest Lyapuov expoets from small data sets, Physical D: Noliear Pheomea, vol. 65, o. -2, pp [4] Z. Liu, Q. Guo, L. Xu, M.A. Ahmad, S. Liu, (2) Double image ecryptio by usig iterative radom biary, Optics
13 America Joural of Sigal Processig 26, 6(): -3 3 Commuicatios 275 (2), [5] Z-L. Zhu, W. Zhag, K-W Wog, H. Yu, (2), A chaos-based symmetric image ecryptio scheme usig bit-level permutatio, Iformatio Scieces [6] C. Li, S. Li, K.-T. Lo, (2), Breakig a modified substitutio-diffusio image cipher based o chaotic stadard ad logistic maps, Commuicatios i Noliear Sciece ad Numerical Simulatio 6 (2) [7] K. Gupta, S. Silakari, (2), New approach for fast color image ecryptio usig chaotic map, Joural of Iformatio Security [8] Ferado Jorge S. Moreira, (992), Chaotic dyamics of quadratic maps, Master s thesis, Uiversity of Porto. [9] V. Lyyk, (2), Chaos-Based Commuicatio Systems. Ph.D. thesis, Czech Techical Uiversity, Faculty of Electrical Egieerig Departmet of Cotrol Egieerig, Prague. [2] M. T. Rosestei, J. J. Collis, ad C. J. de Luca, (993), A practical method for calculatig largest Lyapuov expoets from small data sets, Physica D: Noliear Pheomea, 65, (-2) [2] H. Katz, (994), A robust method to estimate the maximal Lyapuov expoet of a time series, Physics Letters A, 85, () [22] Geisel, T., Faire, V., (984), Statistical properties of chaos i Chebyshev maps, Phys. Lett. A, 5, (6) [23] R Noha, HA HossamEldi, EE Said, ad EA Fathi, (25), Hybrid cipherig system of image based o fractioal Fourier trasform ad two chaotic maps, Iteratioal Joural of Computer Applicatios ( ), 9 () 2 7. [24] J. Fridrich, Symmetric Ciphers Based o Two-Dimesioal Chaotic Maps, It. J. Bifurcatio ad Chaos, Vol. 8, No. 6, pp , 998. [25] [26] C Kevi, B Kare, (23), A evaluatio of image based stegaography methods, Iteratioal Joural of Digital Evidece, volume o. 2, Issue 2. [27] Chog Fu, Jujie Che, Hao Zou, Weihog Meg, Yogfeg Zha, ad Yawe, (22), A chaos based digital image ecryptio scheme with a improved diffusio strategy, Optics Express, volume o. 2. [28] Y. Wag, K-W. Wog, X. Liao, G. Che, (2), A ew chaos-based fast image ecryptio algorithm, Applied Soft Computig ()
Excellent Performances of The Third-level Disturbed Chaos in The Cryptography Algorithm and The Spread Spectrum Communication
Joural of Iformatio Hidig ad Multimedia Sigal Processig c 26 ISSN 273-422 Ubiquitous Iteratioal Volume 7, Number 4, July 26 Excellet Performaces of The Third-level Disturbed Chaos i The Cryptography Algorithm
More informationAN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS
http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC
More informationModified Logistic Maps for Cryptographic Application
Applied Mathematics, 25, 6, 773-782 Published Olie May 25 i SciRes. http://www.scirp.org/joural/am http://dx.doi.org/.4236/am.25.6573 Modified Logistic Maps for Cryptographic Applicatio Shahram Etemadi
More informationA Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationVolume 3, Number 2, 2017 Pages Jordan Journal of Electrical Engineering ISSN (Print): , ISSN (Online):
JJEE Volume 3, Number, 07 Pages 50-58 Jorda Joural of Electrical Egieerig ISSN (Prit: 409-9600, ISSN (Olie: 409-969 Liftig Based S-Box for Scalable Bloc Cipher Desig Based o Filter Bas Saleh S. Saraireh
More informationDiscrete Orthogonal Moment Features Using Chebyshev Polynomials
Discrete Orthogoal Momet Features Usig Chebyshev Polyomials R. Mukuda, 1 S.H.Og ad P.A. Lee 3 1 Faculty of Iformatio Sciece ad Techology, Multimedia Uiversity 75450 Malacca, Malaysia. Istitute of Mathematical
More informationStatistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons
Statistical Aalysis o Ucertaity for Autocorrelated Measuremets ad its Applicatios to Key Comparisos Nie Fa Zhag Natioal Istitute of Stadards ad Techology Gaithersburg, MD 0899, USA Outlies. Itroductio.
More informationOblivious Transfer using Elliptic Curves
Oblivious Trasfer usig Elliptic Curves bhishek Parakh Louisiaa State Uiversity, ato Rouge, L May 4, 006 bstract: This paper proposes a algorithm for oblivious trasfer usig elliptic curves lso, we preset
More informationAlgorithm of Superposition of Boolean Functions Given with Truth Vectors
IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: 694-84 wwwijcsiorg 9 Algorithm of Superpositio of Boolea Fuctios Give with Truth Vectors Aatoly Plotikov, Aleader
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
More informationStudy on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm
Joural of ad Eergy Egieerig, 05, 3, 43-437 Published Olie April 05 i SciRes. http://www.scirp.org/joural/jpee http://dx.doi.org/0.436/jpee.05.34058 Study o Coal Cosumptio Curve Fittig of the Thermal Based
More informationResearch Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property
Discrete Dyamics i Nature ad Society Volume 2011, Article ID 360583, 6 pages doi:10.1155/2011/360583 Research Article A Note o Ergodicity of Systems with the Asymptotic Average Shadowig Property Risog
More informationResearch Article A Unified Weight Formula for Calculating the Sample Variance from Weighted Successive Differences
Discrete Dyamics i Nature ad Society Article ID 210761 4 pages http://dxdoiorg/101155/2014/210761 Research Article A Uified Weight Formula for Calculatig the Sample Variace from Weighted Successive Differeces
More informationNEW IDENTIFICATION AND CONTROL METHODS OF SINE-FUNCTION JULIA SETS
Joural of Applied Aalysis ad Computatio Volume 5, Number 2, May 25, 22 23 Website:http://jaac-olie.com/ doi:.948/252 NEW IDENTIFICATION AND CONTROL METHODS OF SINE-FUNCTION JULIA SETS Jie Su,2, Wei Qiao
More informationCS321. Numerical Analysis and Computing
CS Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 September 8 5 What is the Root May physical system ca
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationSession 5. (1) Principal component analysis and Karhunen-Loève transformation
200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationInternal Information Representation and Processing
Iteral Iformatio Represetatio ad Processig CSCE 16 - Fudametals of Computer Sciece Dr. Awad Khalil Computer Sciece & Egieerig Departmet The America Uiversity i Cairo Decimal Number System We are used to
More informationModule 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur
Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationCS537. Numerical Analysis and Computing
CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be
More informationDISTRIBUTION LAW Okunev I.V.
1 DISTRIBUTION LAW Okuev I.V. Distributio law belogs to a umber of the most complicated theoretical laws of mathematics. But it is also a very importat practical law. Nothig ca help uderstad complicated
More informationStability Analysis of the Euler Discretization for SIR Epidemic Model
Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we
More informationInvariability of Remainder Based Reversible Watermarking
Joural of Network Itelligece c 16 ISSN 21-8105 (Olie) Taiwa Ubiquitous Iformatio Volume 1, Number 1, February 16 Ivariability of Remaider Based Reversible Watermarkig Shao-Wei Weg School of Iformatio Egieerig
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationResearch Article A New Second-Order Iteration Method for Solving Nonlinear Equations
Abstract ad Applied Aalysis Volume 2013, Article ID 487062, 4 pages http://dx.doi.org/10.1155/2013/487062 Research Article A New Secod-Order Iteratio Method for Solvig Noliear Equatios Shi Mi Kag, 1 Arif
More informationChapter 6 Sampling Distributions
Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to
More informationExact Solutions for a Class of Nonlinear Singular Two-Point Boundary Value Problems: The Decomposition Method
Exact Solutios for a Class of Noliear Sigular Two-Poit Boudary Value Problems: The Decompositio Method Abd Elhalim Ebaid Departmet of Mathematics, Faculty of Sciece, Tabuk Uiversity, P O Box 741, Tabuki
More informationInvestigating the Significance of a Correlation Coefficient using Jackknife Estimates
Iteratioal Joural of Scieces: Basic ad Applied Research (IJSBAR) ISSN 2307-4531 (Prit & Olie) http://gssrr.org/idex.php?joural=jouralofbasicadapplied ---------------------------------------------------------------------------------------------------------------------------
More informationHigher-order iterative methods by using Householder's method for solving certain nonlinear equations
Math Sci Lett, No, 7- ( 7 Mathematical Sciece Letters A Iteratioal Joural http://dxdoiorg/785/msl/5 Higher-order iterative methods by usig Householder's method for solvig certai oliear equatios Waseem
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationResearch Article Approximate Riesz Algebra-Valued Derivations
Abstract ad Applied Aalysis Volume 2012, Article ID 240258, 5 pages doi:10.1155/2012/240258 Research Article Approximate Riesz Algebra-Valued Derivatios Faruk Polat Departmet of Mathematics, Faculty of
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationEstimation of Population Mean Using Co-Efficient of Variation and Median of an Auxiliary Variable
Iteratioal Joural of Probability ad Statistics 01, 1(4: 111-118 DOI: 10.593/j.ijps.010104.04 Estimatio of Populatio Mea Usig Co-Efficiet of Variatio ad Media of a Auxiliary Variable J. Subramai *, G. Kumarapadiya
More informationUniform Strict Practical Stability Criteria for Impulsive Functional Differential Equations
Global Joural of Sciece Frotier Research Mathematics ad Decisio Scieces Volume 3 Issue Versio 0 Year 03 Type : Double Blid Peer Reviewed Iteratioal Research Joural Publisher: Global Jourals Ic (USA Olie
More informationModified Ratio Estimators Using Known Median and Co-Efficent of Kurtosis
America Joural of Mathematics ad Statistics 01, (4): 95-100 DOI: 10.593/j.ajms.01004.05 Modified Ratio s Usig Kow Media ad Co-Efficet of Kurtosis J.Subramai *, G.Kumarapadiya Departmet of Statistics, Podicherry
More informationOlli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5
Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4
More informationElectricity consumption forecasting method based on MPSO-BP neural network model Youshan Zhang 1, 2,a, Liangdong Guo2, b,qi Li 3, c and Junhui Li2, d
4th Iteratioal Coferece o Electrical & Electroics Egieerig ad Computer Sciece (ICEEECS 2016) Electricity cosumptio forecastig method based o eural etwork model Yousha Zhag 1, 2,a, Liagdog Guo2, b,qi Li
More informationLecture 11: Pseudorandom functions
COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt
More informationOn the Linear Complexity of Feedback Registers
O the Liear Complexity of Feedback Registers A. H. Cha M. Goresky A. Klapper Northeaster Uiversity Abstract I this paper, we study sequeces geerated by arbitrary feedback registers (ot ecessarily feedback
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More information-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION
NEW NEWTON-TYPE METHOD WITH k -ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION R. Thukral Padé Research Cetre, 39 Deaswood Hill, Leeds West Yorkshire, LS7 JS, ENGLAND ABSTRACT The objective
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationChapter 9: Numerical Differentiation
178 Chapter 9: Numerical Differetiatio Numerical Differetiatio Formulatio of equatios for physical problems ofte ivolve derivatives (rate-of-chage quatities, such as velocity ad acceleratio). Numerical
More informationProbability, Expectation Value and Uncertainty
Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such
More informationChandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter
Cotemporary Egieerig Scieces, Vol. 3, 00, o. 4, 9-00 Chadrasekhar ype Algorithms for the Riccati Equatio of Laiiotis Filter Nicholas Assimakis Departmet of Electroics echological Educatioal Istitute of
More informationMathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution
America Joural of Theoretical ad Applied Statistics 05; 4(: 6-69 Published olie May 8, 05 (http://www.sciecepublishiggroup.com/j/ajtas doi: 0.648/j.ajtas.05040. ISSN: 6-8999 (Prit; ISSN: 6-9006 (Olie Mathematical
More information11 Correlation and Regression
11 Correlatio Regressio 11.1 Multivariate Data Ofte we look at data where several variables are recorded for the same idividuals or samplig uits. For example, at a coastal weather statio, we might record
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationThe Choquet Integral with Respect to Fuzzy-Valued Set Functions
The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i
More informationFree Space Optical Wireless Communications under Turbulence Channel Effect
IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue 3, Ver. III (May - Ju. 014), PP 01-08 Free Space Optical Wireless Commuicatios uder Turbulece
More informationμ are complex parameters. Other
A New Numerical Itegrator for the Solutio of Iitial Value Problems i Ordiary Differetial Equatios. J. Suday * ad M.R. Odekule Departmet of Mathematical Scieces, Adamawa State Uiversity, Mubi, Nigeria.
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationOptimum LMSE Discrete Transform
Image Trasformatio Two-dimesioal image trasforms are extremely importat areas of study i image processig. The image output i the trasformed space may be aalyzed, iterpreted, ad further processed for implemetig
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationModified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations
Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-
More informationDirection of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c
4th Iteratioal Coferece o Advaced Materials ad Iformatio Techology Processig (AMITP 06) Directio of Arrival Estimatio Method i Uderdetermied Coditio Zhag Youzhi a, Li eibo b, ag Hali c Naval Aeroautical
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationANALYSIS OF EXPERIMENTAL ERRORS
ANALYSIS OF EXPERIMENTAL ERRORS All physical measuremets ecoutered i the verificatio of physics theories ad cocepts are subject to ucertaities that deped o the measurig istrumets used ad the coditios uder
More informationLecture 10: Universal coding and prediction
0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationMCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions
Faculty of Egieerig MCT242: Electroic Istrumetatio Lecture 2: Istrumetatio Defiitios Overview Measuremet Error Accuracy Precisio ad Mea Resolutio Mea Variace ad Stadard deviatio Fiesse Sesitivity Rage
More informationQuantum Simulation: Solving Schrödinger Equation on a Quantum Computer
Purdue Uiversity Purdue e-pubs Birc Poster Sessios Birc Naotechology Ceter 4-14-008 Quatum Simulatio: Solvig Schrödiger Equatio o a Quatum Computer Hefeg Wag Purdue Uiversity, wag10@purdue.edu Sabre Kais
More informationInformation Theory and Coding
Sol. Iformatio Theory ad Codig. The capacity of a bad-limited additive white Gaussia (AWGN) chael is give by C = Wlog 2 ( + σ 2 W ) bits per secod(bps), where W is the chael badwidth, is the average power
More informationEconomy and Application of Chaos Theory
Iteratioal Joural of Busiess, Humaities ad Techology Vol. 5, No. 5; October 2015 Ecoomy ad Applicatio of Chaos Theory Petr Dostál Bro Uiversity of Techology Faculty of Busiess ad Maagemet Istitute of Iformatics
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationWHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? ABSTRACT
WHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? Harold G. Loomis Hoolulu, HI ABSTRACT Most coastal locatios have few if ay records of tsuami wave heights obtaied over various time periods. Still
More informationOPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE
Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationExponential transient rotating waves and their bifurcations in a ring of unidirectionally coupled bistable Lorenz systems
Available olie at www.sciecedirect.com Procedia IUTAM 5 (2012 ) 283 287 IUTAM Symposium o 50 Years of Chaos: Applied ad Theoretical Expoetial trasiet rotatig waves ad their bifurcatios i a rig of uidirectioally
More informationFive Steps Block Predictor-Block Corrector Method for the Solution of ( )
Applied Mathematics, 4,, -66 Published Olie May 4 i SciRes. http://www.scirp.org/oural/am http://dx.doi.org/.46/am.4.87 Five Steps Block Predictor-Block Corrector y = f x, y, y Method for the Solutio of
More information577. Estimation of surface roughness using high frequency vibrations
577. Estimatio of surface roughess usig high frequecy vibratios V. Augutis, M. Sauoris, Kauas Uiversity of Techology Electroics ad Measuremets Systems Departmet Studetu str. 5-443, LT-5368 Kauas, Lithuaia
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More informationResearch Article Nonautonomous Discrete Neuron Model with Multiple Periodic and Eventually Periodic Solutions
Discrete Dyamics i Nature ad Society Volume 21, Article ID 147282, 6 pages http://dx.doi.org/1.11/21/147282 Research Article Noautoomous Discrete Neuro Model with Multiple Periodic ad Evetually Periodic
More informationAnalytical solutions for multi-wave transfer matrices in layered structures
Joural of Physics: Coferece Series PAPER OPEN ACCESS Aalytical solutios for multi-wave trasfer matrices i layered structures To cite this article: Yu N Belyayev 018 J Phys: Cof Ser 109 01008 View the article
More informationThe target reliability and design working life
Safety ad Security Egieerig IV 161 The target reliability ad desig workig life M. Holický Kloker Istitute, CTU i Prague, Czech Republic Abstract Desig workig life ad target reliability levels recommeded
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More informationCYCLING CHAOS IN ONE-DIMENSIONAL COUPLED ITERATED MAPS
Letters Iteratioal Joural of Bifurcatio ad Chaos, Vol., No. 8 () 859 868 c World Scietific Publishig Compay CYCLING CHAOS IN ONE-DIMENSIONAL COUPLED ITERATED MAPS ANTONIO PALACIOS Departmet of Mathematics,
More informationANTI-SYNCHRONIZING SLIDING CONTROLLER DESIGN FOR IDENTICAL PAN SYSTEMS
ANTI-SYNCHRONIZING SLIDING CONTROLLER DESIGN FOR IDENTICAL PAN SYSTEMS Sudarapadia Vaidyaatha Research ad Developmet Cetre, Vel Tech Dr. RR & Dr. SR Techical Uiversity Avadi, Cheai-600 062, Tamil Nadu,
More informationTHE KALMAN FILTER RAUL ROJAS
THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider
More informationECEN 655: Advanced Channel Coding Spring Lecture 7 02/04/14. Belief propagation is exact on tree-structured factor graphs.
ECEN 655: Advaced Chael Codig Sprig 014 Prof. Hery Pfister Lecture 7 0/04/14 Scribe: Megke Lia 1 4-Cycles i Gallager s Esemble What we already kow: Belief propagatio is exact o tree-structured factor graphs.
More informationRelations between the continuous and the discrete Lotka power function
Relatios betwee the cotiuous ad the discrete Lotka power fuctio by L. Egghe Limburgs Uiversitair Cetrum (LUC), Uiversitaire Campus, B-3590 Diepebeek, Belgium ad Uiversiteit Atwerpe (UA), Campus Drie Eike,
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationA New Simulation Model of Rician Fading Channel Xinxin Jin 1,2,a, Yu Zhang 1,3,b, Changyong Pan 4,c
6 Iteratioal Coferece o Iformatio Egieerig ad Commuicatios Techology (IECT 6 ISB: 978--6595-375-5 A ew Simulatio Model of Ricia Fadig Chael Xixi Ji,,a, Yu Zhag,3,b, Chagyog Pa 4,c Tsighua atioal Laboratory
More informationStreamfunction-Vorticity Formulation
Streamfuctio-Vorticity Formulatio A. Salih Departmet of Aerospace Egieerig Idia Istitute of Space Sciece ad Techology, Thiruvaathapuram March 2013 The streamfuctio-vorticity formulatio was amog the first
More informationPower and Type II Error
Statistical Methods I (EXST 7005) Page 57 Power ad Type II Error Sice we do't actually kow the value of the true mea (or we would't be hypothesizig somethig else), we caot kow i practice the type II error
More informationPower Comparison of Some Goodness-of-fit Tests
Florida Iteratioal Uiversity FIU Digital Commos FIU Electroic Theses ad Dissertatios Uiversity Graduate School 7-6-2016 Power Compariso of Some Goodess-of-fit Tests Tiayi Liu tliu019@fiu.edu DOI: 10.25148/etd.FIDC000750
More informationUsing the IML Procedure to Examine the Efficacy of a New Control Charting Technique
Paper 2894-2018 Usig the IML Procedure to Examie the Efficacy of a New Cotrol Chartig Techique Austi Brow, M.S., Uiversity of Norther Colorado; Bryce Whitehead, M.S., Uiversity of Norther Colorado ABSTRACT
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationt distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference
EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The
More informationTHE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS
R775 Philips Res. Repts 26,414-423, 1971' THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS by H. W. HANNEMAN Abstract Usig the law of propagatio of errors, approximated
More informationThe average-shadowing property and topological ergodicity
Joural of Computatioal ad Applied Mathematics 206 (2007) 796 800 www.elsevier.com/locate/cam The average-shadowig property ad topological ergodicity Rogbao Gu School of Fiace, Najig Uiversity of Fiace
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More information