Cryptanalysis of a discrete-time synchronous chaotic encryption system
|
|
- MargaretMargaret Morris
- 5 years ago
- Views:
Transcription
1 NOTICE: This is the author s version of a work that was accepted b Phsics Letters A in August Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other qualit control mechanisms ma not be reflected in this document. Changes ma have been made to this work since it was submitted for publication. A definitive version will be published in Phsics Letters A, vol. 372, no. 7, pp , 2008, DOI: /j.phsleta Crptanalsis of a discrete-time snchronous chaotic encrption sstem David Arroo a,, Gonzalo Alvarez a,, Shujun Li b, Chengqing Li c and Juana Nunez a a Instituto de Física Aplicada, Consejo Superior de Investigaciones Científicas, Serrano 144, Madrid, Spain b FernUniversität in Hagen, Lehrgebiet Informationstechnik, Universitätsstraße 27, Hagen, German c Department of Electronic Engineering, Cit Universit of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong SAR, China Abstract Recentl a chaotic crptosstem based on discrete-time snchronization has been proposed. Some weaknesses of that new encrption sstem are addressed and eploited in order to successfull crptanalze the sstem. Ke words: Chaotic encrption, Hénon map, known-plaintet attack, crptanalsis PACS: Ac, K. 1 Introduction During the last two decades chaotic sstems have been broadl used in crptographic applications [1 5] eploiting its ergodicit, sensitivit to initial con- Corresponding authors: David Arroo (david.arroo@iec.csic.es), Gonzalo Alvarez ( Preprint submitted to Phsics Letter A 3 Februar 2008
2 ditions, miing propert, and simple analtic description but high comple behavior. However, man of the proposed schemes show important securit weaknesses as a result of a bad or noneistent ke definition and bad or noneistent ke space specification [6 14]. In this letter the crptosstem proposed in [15] is analzed and some deficiencies are pointed out. This crptosstem is built upon the Hénon map, defined as k+1 = 1 a 2 k + k, k+1 = b k. (1) The plaintet is divided into blocks {m k } N 1 k=0, where each block has M bits. The encrption of the plain-blocks is carried out for k = 0 N 1 in turn. For the k-th plain-block m k, the corresponding cipher-block is k+1, which is calculated through Eq. (1) b setting a = ψ (m k ) µ 1 ( k ), (2) b = µ 2 ( k ), (3) where ψ() is a bijective function assuring that a is a valid parameter of Eq. (1) and µ i (), i {1, 2}, are piecewise linear functions defined as b i,1 (), if a i,1 () < a i,2 (), µ i () = b i,j (), if a i,j () < a i,j+1 (), b i,l (), if a i,l () < a i,l+1 (), (4) where a i,j () is an function making one and onl one condition on the right hand of Eq. (4) satisfied for an, and b i,j () is an function making a and b valid control parameters of Eq. (1). At the receiver, the decrption of m k following two steps: is carried out snchronousl in the Generate intermediate variable ψ(m k ) b Eq. (5); ψ (m k ) = 1 k+1 + k, (5) µ 1 ( k ) 2 k k+1 = µ 2 ( k ) k. (6) Get m k = ψ 1 (ψ(m k )), where ψ 1 () is the inverse function of ψ(). 2
3 As claimed in [15, Sec. 2], the secret ke of the crptosstem includes the following three subkes: (1) The initial condition of the second component of the Hénon map, i.e., 0. (2) The M-ar switching ke (MSK) mechanism which is the function ψ(). (3) The pseudo-random switching ke (PRSK) mechanism which is given b the functions µ 1 () and µ 2 (). Based on the above general form of the proposed crptosstem, the original authors present a concrete configuration: M = 48, ψ(), µ 1 () and µ 2 () are set in Eqs. (7), (8), (9) respectivel. ψ () = A + B = , (7) , if 0.1 +, , if < µ 1 () =, , if < 0.3 +, , otherwise , if 0.1 +, , if < µ 2 () =, , if < 0.3 +, , otherwise. 10 (8) (9) Obviousl, Eqs. (8), (9) are equivalent to Eqs. (10), (11) respectivel µ 1 () = , otherwise. 10.2, if µ 2 () = , otherwise ,, if < ; < 13 15,, if < ; < 13 10,, if ,, if < ; < ,, if < ; < < , (10) (11) This paper focuses on the securit analsis of the crptosstem under the above specific configuration. For more details about its working, the reader is referred to [15]. The rest of the paper is organized as follows. In the net section some design problems of the crptosstem are emphasized. In the following 3
4 section different attacks are described. Finall, some concluding remarks and conclusions are given. a Unbounded Periodic Fig. 1. Chaotic region for the Hénon map. b 2 Design weaknessses 2.1 Loss of chaoticit of the Hénon map As remarked in [16, Rules 4 and 5], a well designed crptosstem is characterized b a precise definition of the secret ke and a crptographicall large ke space. In [15] the secret ke depends on the selection of the functions that build either the MSK or PRSK mechanisms. However, there is no clue in [15] about how to find those functions. It is onl demanded that the equations in Eq. (1) are alwas bounded. This is a big problem when considering the ke echange and the crptosstem hardware implementation [16, Rules 1 and 3]. The crptosstem s securit analsis of [15, Sec. 6] demonstrates that the decrption process demands that the PRSK and MSK settings are eactl the same as the ones used during the encrption step. Indeed, it makes difficult to guess the ke value, but it also implies the secret ke echange has to be ver precise. Provided that the design for MSK is left open and PRSK is designed using real numbers, the ke echange in the crptosstem proposed in [15] is going to be ver comple. Moreover, it is not eas to find proper functions so that the sstem described b Eq. (1) shows a chaotic behavior. Furthermore, the functions given in [15] 4
5 as an eample for M = 48, i.e, Eqs. (7), (8) and (9), do not allow the crptosstem to work in the chaotic region of the Hénon map. A common method to determine whether a dnamical sstem with the given control parameters is chaotic is to calculate its maimum Lapunov eponent. Figure 1 depicts the set of points (a, b) for which the maimal Lapunov eponent of the Hénon map is positive. (a) (b) Fig. 2. Pseudo-random switching ke analsis: a) a values for random plaintet; b) b values for random plaintet. When a random plaintet generated b the rand() function of Matlab is encrpted with Eqs. (1), (7), (8), (9), M = 48, (0) = 0.4 and (0) = 0.5, the product ψ (m k ) µ 1 ( k ) is alwas out of the chaotic region (see Fig. 2). Figure 3 shows that, after a number of transient values, the ciphertet reaches a constant value or a pair of constant values. This is a result of the crptosstem being alwas working in periodic windows of the Hénon map. The condition for other definitions of ψ(), µ 1 () and µ 2 () ma be better, but it is difficult to make the sstem remain alwas in the chaotic region of the Hénon map. The best solution would be to use other maps with a broader chaotic region. 2.2 Deficient compression performance In [15] it is mentioned that the crptosstem under stud gives a ciphertet that requires a smaller storage size than the one for the plaintet, since each message block of M bits is encrpted into a single-precision floating-point number (a number that is 32-bits long). Therefore, if M is greater than 32 it is epected to reduce the storage size for the resulting ciphertet comparing to the one for the plaintet. However, this is not true. 5
6 Asmptotic values Plaintet block values Fig. 3. Ciphertet values for plaintet blocks with a fied value. The function ψ() has to be a bijective function, i.e., each output value of this function is associated to one and onl one input value. If m k is a 32-bit value it means that there are 2 32 possible values for ψ(m k ). The plaintet block m k is M-bits long and consequentl there are 2 M possible values for m k. Therefore, if M > 32 then ψ(m k ) is not a bijective function. This problem was verified dealing with the crptosstem referred b Eqs. (1), (7), (8), (9), M = 48, 0 = 0.4 and 0 = 0.5. A random block plaintet was encrpted and decrpted being all the operations computed with single-precision floatingpoint numbers, i.e., ever number was 32-bit long. The decrpted tet was compared to the original plaintet and there was a 28% of bits different from the original ones. The bit error rate is approimatel one third, as epected given that 32 bits are used to represent 48-bit values. The authors of [15] might have been using double-precision floating-point (64-bit) numbers in their eperiments, thus overlooking this fact. 2.3 Decrption errors due to finite precision computations The decrption of the ciphertet k involves the inversion of ψ(m k ). In the sample implementation given in [15], ψ(m k ) is determined b Eq. (7) and the 48-bit plaintet block is recovered b inverting Eq. (7): m k = ψ (m k) A, (12) B where ψ (m k ) has been calculated from the ciphertet b using Eq. (5). If the value recovered from Eq. (5) is not eactl the one used during the encrption process for m k, then the value given b Eq. (12) is not an integer. This happens if all the mathematical operations are in finite precision, as it occurs in the 6
7 encrption scheme under eamination. It was actuall verified that the result of Eq. (12) is never an integer. Thus the value returned b the decrption process needs to be rounded in order to recover the original information. This was not mentioned in [15] and poses the following problem: some blocks of the original plaintet are incorrectl recovered from the ciphertet, i.e., it eists a residual bit error rate derived from the fact that ever computation is in finite precision, as shown in Fig. 4. The crptosstem s securit analsis made in [15, Sec. 6] emphasizes that a crptanalst will require identifing a number of ψ(k) output values with high certaint and precision. Figure 4 informs that this high certaint and precision requirement concerns not onl the crptanalst but also the receiver BER (%) Number of 48 bit plaintet blocks 10 4 Fig. 4. Bit Error Rate for M = 48 and different plaintet lengths. 3 Partial ke recover attack In the contet of a secure and robust encrption sstem it is assumed that the partial knowledge of the ke does not reveal information about the rest of the ke and, as a result, the crptostem performance is not harmed [16, Rule 7]. However, in the scenario drawn b [15], partial knowledge of the ke can be used to obtain the rest of the ke. Along the section we describe a knownplaintet attack [17, p. 25], where it is possible to reconstruct the supporting PRSK mechanism functions and 0, assuming that the attacker has access to ψ(m k ) for ever possible value of m k. Given two plaintets {m 1,k } N 1 k=0, {m 2,k} N 1 k=0, then 7
8 1,1 = 1 ψ(m 1,0 ) µ 1 ( 0 ) , (13) 2,1 = 1 ψ(m 2,0 ) µ 1 ( 0 ) (14) and 1,k+1 = 1 ψ(m 1,k ) µ 1 ( k ) 2 1,k + k, (15) 2,k+1 = 1 ψ(m 2,k ) µ 1 ( k ) 2 2,k + k, (16) k = µ 2 ( k 1 ) k 1, (17) where k µ µ (a) (b) µ µ (c) (d) Fig. 5. Recovered and original functions for the PRSK mechanism when the are designed as in [15]: a) µ 1 () for 0 = ; b) image zoom for µ 1 () and 0 = ; c) µ 1 () for 0 = ; and d) image zoom for µ 1 () and 0 = Subtracting Eq. (13) from Eq. (14), one obtains: 8
9 2,1 1,1 = ψ(m 1,0 ) µ 1 ( 0 ) 2 0 ψ(m 2,0 ) µ 1 ( 0 ) 2 0 = (ψ(m 1,0 ) ψ(m 2,0 )) µ 1 ( 0 ) 2 0. (18) In the following discussion, it is shown how to recover the secret ke, assuming that ψ() is known. From Eq. (18), one has r 1 = 2,1 1,1 ψ(m 1,0 ) ψ(m 2,0 ). (19) Because the encrption is generall carried out in floating point operation, the quantization error is ver small in most cases and can be ignored. As a result, r 1 = µ 1 ( 0 ) 2 0, which implies that 0 = 1,1 1 + ψ(m 1,0 ) r 1, and µ 1 ( 0 ) = r Subtracting Eq. (15) from Eq. (16): µ 1 ( k ) = 2,k+1 1,k+1 ψ(m 1,k ) 2 1,k ψ(m 2,k) 2 2,k (20) From Eq. (17): µ 2 ( k 1 ) = 1,k ψ(m 1,k ) µ 1 ( k ) 2 1,k k 1. (21) As mentioned above, b ignoring the quantization error, we have µ 1 ( k ) = µ 1 ( k ) and µ 2 ( k 1 ) = µ 2 ( k 1 ). Repeating this procedure for k = 1,..., N it is possible to reconstruct µ 1 ( k ) and µ 2 ( k ). In order to prove the proposed known-plaintet attack, points for µ 1 ( k ) and µ 2 ( k ) were calculated for 0 = 0.4, 0 = and 0 = 0.4, 0 = In Figs. 5 and 6 it is shown how it was possible to infer µ 1 ( k ), µ 2 ( k ) shape. This is due to the fact that the first component of the Hénon map emploed in the encrption process is sent through the communication channel without appling an masking transformation. However, there eists an underling quantization error in the recovering method due to the fact that all the mathematical operations are done in finite precision. It was verified that (µ 1 ) 10 6 and (µ 2 ) Therefore, the eact µ 1 and µ 2 reconstruction demands an ehaustive search. On the other hand, Figs. 5 and 6 also show that during the encrption process µ 1 ( k ) and µ 2 ( k ) do not go 9
10 µ µ (a) (b) µ µ (c) (d) Fig. 6. Recovered and original functions for the PRSK mechanism when the are designed as in [15]: a) µ 2 () for 0 = ; b) image zoom for µ 2 () and 0 = ; c) µ 2 () for 0 = ; and d) image zoom for µ 2 () and 0 = through all the possible values of the functions referred b Eqs. (8) and (9). In other words, it was verified that, during the encrption process, k never goes through all the possible input values for both functions. This is the reason wh µ 1 () and µ 2 () can not be totall recovered, which has no impact on the efficienc of the crptanalsis. This attack has been carried out in a scenario where the attacker knows ψ(). Nevertheless, the crptosstem allows other kinds of known-plaintet attacks where ψ() is not known. For instance, Eq. (18) clearl reveals a leak of information from ψ(): one can assure that ψ() is a linear function if the value of 2,1 1,1 keep unchanged for different (m 1,0, m 2,0 ) pairs, where (m 1,0 m 2,0 ) is kept fied. To be more precise, in view of Eqs. (5) and (6), different values of ψ() ma be calculated if the rest of the subkes are known. The details of 10
11 this attack are not given because it is an analogue of the one just described and because the weakness of the crptosstem has been profusel proved. 4 Conclusions In this paper some securit and design problems of a chaotic crptosstem based on discrete-time snchronization have been pointed out. First of all, it has been remarked the lack of a description about the ke space and it has been also emphasized the difficult of finding new kes in a crptosstem as the one referred in [15]. Finall it has been shown that it is possible to break the crptosstem when the kes are selected as in [15] using a known plaintet attack and assuming a partial knowledge of the ke. This analsis reveals that the choice of chaotic map is all important. Maps with irregular chaotic regions as those depicted in Fig. 1 should be avoided, in favor of maps with more uniform distributions. In this wa the chaotic behavior for a wider range of parameters can be guaranteed. As has been shown, entering into periodic windows has negative impact on the algorithm s securit. Another important point to be emphasized is that both the ke and ke space should be thoroughl described and should be designed in a wa as to facilitate the selection of valid kes. Acknowledgments The work described in this letter was partiall supported b Ministerio de Educación Ciencia of Spain, Research Grant SEG Shujun Li was supported b the Aleander von Humboldt Foundation, German. References [1] S. Li, Analses and new designs of digital chaotic ciphers, Ph.D. thesis, School of Electronic and Information Engineering, Xi an Jiaotong Universit, Xi an, China, available online at (June 2003). [2] T. Yang, A surve of chaotic secure communication sstems, Int. J. Comp. Cognition 2 (2) (2004) [3] G. Alvarez, F. Montoa, M. Romera, G. Pastor, Chaotic crptosstems, in: L. D. Sanson (Ed.), Proc. 33rd Annual 1999 International Carnahan Conference on Securit Technolog, IEEE, 1999, pp
12 [4] L. Kocarev, Chaos-based crptograph: A brief overview, IEEE Circuits Sst. Mag. 1 (2001) [5] J. Amigo, L. Kocarev, J. Szczepanski, Theor and practice of chaotic crptograph, Phs. Lett. A 366 (3) (2007) [6] G. Alvarez, S. Li, Breaking an encrption scheme based on chaotic baker map, Phs. Lett. A 352 (1-2) (2006) [7] S. Li, G. Chen, K.-W. Wong, X. Mou, Y. Cai, Baptista-tpe chaotic crptosstems: Problems and countermeasures, Phs. Lett. A 332 (5-6) (2004) [8] G. Alvarez, F. Montoa, M. Romera, G. Pastor, Crptanalsis of dnamic lookup table based chaotic crptosstems, Phs. Lett. A 326 (3-4) (2003) [9] G. Alvarez, F. Montoa, M. Romera, G. Pastor, Crptanalsis of a discrete chaotic crptosstem using eternal ke, Phs. Lett. A 319 (3-4) (2003) [10] G. Alvarez, F. Montoa, M. Romera, G. Pastor, Crptanalsis of an ergodic chaotic cipher, Phs. Lett. A 311 (2-3) (2003) [11] S. Li, X. Mou, Z. Ji, J. Zhang, Y. Cai, Performance analsis of jakimoski-kocarev attack on a class of chaotic crptosstems, Phs. Lett. A 307 (1) (2003) [12] G. Jakimoski, L. Kocarev, Analsis of some recentl proposed chaos-based encrption algorithms, Phs. Lett. A 291 (6) (2001) [13] S. Li, X. Mou, Y. Cai, Improving securit of a chaotic encrption approach, Phs. Lett. A 290 (3-4) (2001) [14] G. Alvarez, F. Montoa, M. Romera, G. Pastor, Crptanalsis of a chaotic encrption sstem, Phs. Lett. A 276 (1) (2000) [15] C. Y. Chee, D. Xu, Chaotic encrption using dicrete-time snchronous chaos, Phsics Letters A 348 (3-6) (2006) [16] G. Alvarez, S. Li, Some basic crptographic requirements for chaos-based crptosstems, International Journal of Bifurcation and Chaos 16 (8) (2006) [17] D. Stinson, Crptograph: Theor and Practice, CRC Press,
Cryptanalysis of a computer cryptography scheme based on a filter bank
NOTICE: This is the author s version of a work that was accepted by Chaos, Solitons & Fractals in August 2007. Changes resulting from the publishing process, such as peer review, editing, corrections,
More informationBreaking an encryption scheme based on chaotic Baker map
Breaking an encryption scheme based on chaotic Baker map Gonzalo Alvarez a, and Shujun Li b a Instituto de Física Aplicada, Consejo Superior de Investigaciones Científicas, Serrano 144 28006 Madrid, Spain
More informationarxiv:nlin/ v1 [nlin.cd] 10 Aug 2006
Cryptanalysis of a chaotic block cipher with external key and its improved version arxiv:nlin/0608020v1 [nlin.cd] 10 Aug 2006 Chengqing Li a,, Shujun Li b,, Gonzalo Álvarezc, Guanrong Chen a and Kwok-Tung
More informationarxiv: v1 [cs.cr] 18 Jul 2009
Breaking a Chaotic Cryptographic Scheme Based on Composition Maps Chengqing Li 1, David Arroyo 2, and Kwok-Tung Lo 1 1 Department of Electronic and Information Engineering, The Hong Kong Polytechnic University,
More informationarxiv:cs/ v1 [cs.cr] 2 Feb 2004
Problems of Baptista s chaotic cryptosystems and countermeasures for enhancement of their overall performances arxiv:cs/0402004v1 [cs.cr] 2 Feb 2004 Shujun Li, Guanrong Chen Department of Electronic Engineering,
More informationResearch Article A New Four-Scroll Chaotic Attractor Consisted of Two-Scroll Transient Chaotic and Two-Scroll Ultimate Chaotic
Mathematical Problems in Engineering Volume, Article ID 88, pages doi:.//88 Research Article A New Four-Scroll Chaotic Attractor Consisted of Two-Scroll Transient Chaotic and Two-Scroll Ultimate Chaotic
More informationLorenz System Parameter Determination and Application to Break the Security of Two-channel Chaotic Cryptosystems
1 Lorenz System Parameter Determination and Application to Break the Security of Two-channel Chaotic Cryptosystems A. B. Orue, G. Alvarez, M. Romera, G. Pastor, F. Montoya and Shujun Li arxiv:nlin/669v
More informationResearch Article Chaos and Control of Game Model Based on Heterogeneous Expectations in Electric Power Triopoly
Discrete Dnamics in Nature and Societ Volume 29, Article ID 469564, 8 pages doi:.55/29/469564 Research Article Chaos and Control of Game Model Based on Heterogeneous Epectations in Electric Power Triopol
More informationOn the security of a chaotic encryption scheme: problems with computerized chaos in finite computing precision
On the security of a chaotic encryption scheme: problems with computerized chaos in finite computing precision Shujun Li a,, Xuanqin Mou a, Yuanlong Cai a, Zhen Ji b and Jihong Zhang b a School of Electronics
More informationResearch Article Chaotic Attractor Generation via a Simple Linear Time-Varying System
Discrete Dnamics in Nature and Societ Volume, Article ID 836, 8 pages doi:.//836 Research Article Chaotic Attractor Generation via a Simple Linear Time-Varing Sstem Baiu Ou and Desheng Liu Department of
More informationCryptanalysis of a Multistage Encryption System
Cryptanalysis of a Multistage Encryption System Chengqing Li, Xinxiao Li, Shujun Li and Guanrong Chen Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027, China Software Engineering
More information6.4 graphs OF logarithmic FUnCTIOnS
SECTION 6. graphs of logarithmic functions 9 9 learning ObjeCTIveS In this section, ou will: Identif the domain of a logarithmic function. Graph logarithmic functions. 6. graphs OF logarithmic FUnCTIOnS
More informationarxiv: v1 [cs.cr] 5 Dec 2007
Cryptanalysis of an image encryption scheme based on the Hill cipher Chengqing Li a,, Dan Zhang b, and Guanrong Chen a arxiv:07120693v1 [cscr] 5 Dec 2007 a Department of Electronic Engineering, City University
More information4452 Mathematical Modeling Lecture 13: Chaos and Fractals
Math Modeling Lecture 13: Chaos and Fractals Page 1 442 Mathematical Modeling Lecture 13: Chaos and Fractals Introduction In our tetbook, the discussion on chaos and fractals covers less than 2 pages.
More informationChaos Cryptography: Relation Of Entropy With Message Length and Period
Chaotic Modeling and Simulation (CMSIM) 4: 57-58, 03 Chaos Crptograph: Relation Of Entrop With Message Length and Period George Makris, Ioannis Antoniou Complex Sstems Analsis Laborator, Mathematics Department,
More informationCryptanalyzing a nonlinear chaotic algorithm (NCA) for image encryption
NOTICE: This is the author s version of a work that was accepted by Communications in Nonlinear Science and Numerical Simulations in February 29. Changes resulting from the publishing process, such as
More informationMULTI-SCROLL CHAOTIC AND HYPERCHAOTIC ATTRACTORS GENERATED FROM CHEN SYSTEM
International Journal of Bifurcation and Chaos, Vol. 22, No. 2 (212) 133 ( pages) c World Scientific Publishing Compan DOI: 1.1142/S21812741332 MULTI-SCROLL CHAOTIC AND HYPERCHAOTIC ATTRACTORS GENERATED
More informationCONTINUOUS SPATIAL DATA ANALYSIS
CONTINUOUS SPATIAL DATA ANALSIS 1. Overview of Spatial Stochastic Processes The ke difference between continuous spatial data and point patterns is that there is now assumed to be a meaningful value, s
More informationarxiv: v2 [cs.cr] 13 Oct 2016
Nonlinear Dynamics manuscript No. (will be inserted by the editor) Cryptanalyzing image encryption scheme using chaotic logistic map Chengqing Li Tao Xie Qi Liu Ge Cheng arxiv:3.489v2 [cs.cr] 3 Oct 26
More informationMethods for Advanced Mathematics (C3) Coursework Numerical Methods
Woodhouse College 0 Page Introduction... 3 Terminolog... 3 Activit... 4 Wh use numerical methods?... Change of sign... Activit... 6 Interval Bisection... 7 Decimal Search... 8 Coursework Requirements on
More informationA NEW CHAOTIC ATTRACTOR FROM 2D DISCRETE MAPPING VIA BORDER-COLLISION PERIOD-DOUBLING SCENARIO
A NEW CHAOTIC ATTRACTOR FROM D DISCRETE MAPPING VIA BORDER-COLLISION PERIOD-DOUBLING SCENARIO ZERAOULIA ELHADJ Received 1 April 5 The following map is studied: (, ) (1 + a( )+,b). It is proved numericall
More informationExponential and Logarithmic Functions
Eponential and Logarithmic Functions 6 Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) CHAPTER OUTLINE 6. Eponential Functions 6. Logarithmic Properties 6. Graphs
More informationFlows and Connectivity
Chapter 4 Flows and Connectivit 4. Network Flows Capacit Networks A network N is a connected weighted loopless graph (G,w) with two specified vertices and, called the source and the sink, respectivel,
More information14.1 Systems of Linear Equations in Two Variables
86 Chapter 1 Sstems of Equations and Matrices 1.1 Sstems of Linear Equations in Two Variables Use the method of substitution to solve sstems of equations in two variables. Use the method of elimination
More informationExact Equations. M(x,y) + N(x,y) y = 0, M(x,y) dx + N(x,y) dy = 0. M(x,y) + N(x,y) y = 0
Eact Equations An eact equation is a first order differential equation that can be written in the form M(, + N(,, provided that there eists a function ψ(, such that = M (, and N(, = Note : Often the equation
More informationSolutions to Two Interesting Problems
Solutions to Two Interesting Problems Save the Lemming On each square of an n n chessboard is an arrow pointing to one of its eight neighbors (or off the board, if it s an edge square). However, arrows
More informationFinding Limits Graphically and Numerically. An Introduction to Limits
60_00.qd //0 :05 PM Page 8 8 CHAPTER Limits and Their Properties Section. Finding Limits Graphicall and Numericall Estimate a it using a numerical or graphical approach. Learn different was that a it can
More informationQuantum Public-Key Cryptosystem Based on Super Dense Coding Technology
368 JOURNAL OF COMPUTRS, VOL. 8, NO., DCMBR 03 uantum Public-e Crptosstem Based on Super Dense Coding Technolog Xiaou Li School of Information ngineering, Zhenghou Universit, Zhenghou Cit, P. R. China
More informationFinding Limits Graphically and Numerically. An Introduction to Limits
8 CHAPTER Limits and Their Properties Section Finding Limits Graphicall and Numericall Estimate a it using a numerical or graphical approach Learn different was that a it can fail to eist Stud and use
More informationCh 3 Alg 2 Note Sheet.doc 3.1 Graphing Systems of Equations
Ch 3 Alg Note Sheet.doc 3.1 Graphing Sstems of Equations Sstems of Linear Equations A sstem of equations is a set of two or more equations that use the same variables. If the graph of each equation =.4
More informationNumerical Simulation Bidirectional Chaotic Synchronization of Spiegel-Moore Circuit and Its Application for Secure Communication
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Numerical Simulation Bidirectional Chaotic Snchronization of Spiegel-Moore Circuit and Its Application for Secure Communication
More informationA new chaotic attractor from general Lorenz system family and its electronic experimental implementation
Turk J Elec Eng & Comp Sci, Vol.18, No.2, 2010, c TÜBİTAK doi:10.3906/elk-0906-67 A new chaotic attractor from general Loren sstem famil and its electronic eperimental implementation İhsan PEHLİVAN, Yılma
More informationStrain Transformation and Rosette Gage Theory
Strain Transformation and Rosette Gage Theor It is often desired to measure the full state of strain on the surface of a part, that is to measure not onl the two etensional strains, and, but also the shear
More informationTime-Frequency Analysis: Fourier Transforms and Wavelets
Chapter 4 Time-Frequenc Analsis: Fourier Transforms and Wavelets 4. Basics of Fourier Series 4.. Introduction Joseph Fourier (768-83) who gave his name to Fourier series, was not the first to use Fourier
More informationCOMPRESSIVE (CS) [1] is an emerging framework,
1 An Arithmetic Coding Scheme for Blocked-based Compressive Sensing of Images Min Gao arxiv:1604.06983v1 [cs.it] Apr 2016 Abstract Differential pulse-code modulation (DPCM) is recentl coupled with uniform
More informationTHE UNIVERSITY OF MICHIGAN. Timing Analysis of Domino Logic
Timing Analsis of Domino Logic b David Van Campenhout, Trevor Mudge and Karem Sakallah CSE-T-296-96 THE UNIVESITY O MICHIGAN Computer Science and Engineering Division Department of Electrical Engineering
More informationNew communication schemes based on adaptive synchronization
CHAOS 17, 0114 2007 New communication schemes based on adaptive synchronization Wenwu Yu a Department of Mathematics, Southeast University, Nanjing 210096, China, Department of Electrical Engineering,
More information8.1 Exponents and Roots
Section 8. Eponents and Roots 75 8. Eponents and Roots Before defining the net famil of functions, the eponential functions, we will need to discuss eponent notation in detail. As we shall see, eponents
More informationINTRODUCTION GOOD LUCK!
INTRODUCTION The Summer Skills Assignment for has been developed to provide all learners of our St. Mar s Count Public Schools communit an opportunit to shore up their prerequisite mathematical skills
More informationSubband Coding and Wavelets. National Chiao Tung University Chun-Jen Tsai 12/04/2014
Subband Coding and Wavelets National Chiao Tung Universit Chun-Jen Tsai /4/4 Concept of Subband Coding In transform coding, we use N (or N N) samples as the data transform unit Transform coefficients are
More informationFebruary 11, JEL Classification: C72, D43, D44 Keywords: Discontinuous games, Bertrand game, Toehold, First- and Second- Price Auctions
Eistence of Mied Strateg Equilibria in a Class of Discontinuous Games with Unbounded Strateg Sets. Gian Luigi Albano and Aleander Matros Department of Economics and ELSE Universit College London Februar
More informationResearch Design - - Topic 15a Introduction to Multivariate Analyses 2009 R.C. Gardner, Ph.D.
Research Design - - Topic 15a Introduction to Multivariate Analses 009 R.C. Gardner, Ph.D. Major Characteristics of Multivariate Procedures Overview of Multivariate Techniques Bivariate Regression and
More information4.7. Newton s Method. Procedure for Newton s Method HISTORICAL BIOGRAPHY
4. Newton s Method 99 4. Newton s Method HISTORICAL BIOGRAPHY Niels Henrik Abel (18 189) One of the basic problems of mathematics is solving equations. Using the quadratic root formula, we know how to
More informationFrom bell-shaped solitary wave to W/M-shaped solitary wave solutions in an integrable nonlinear wave equation
PRAMANA c Indian Academ of Sciences Vol. 74, No. journal of Januar 00 phsics pp. 9 6 From bell-shaped solitar wave to W/M-shaped solitar wave solutions in an integrable nonlinear wave equation AIYONG CHEN,,,
More information3.3 Logarithmic Functions and Their Graphs
274 CHAPTER 3 Eponential, Logistic, and Logarithmic Functions What ou ll learn about Inverses of Eponential Functions Common Logarithms Base 0 Natural Logarithms Base e Graphs of Logarithmic Functions
More informationAmplitude-phase control of a novel chaotic attractor
Turkish Journal of Electrical Engineering & Computer Sciences http:// journals. tubitak. gov. tr/ elektrik/ Research Article Turk J Elec Eng & Comp Sci (216) 24: 1 11 c TÜBİTAK doi:1.396/elk-131-55 Amplitude-phase
More informationControl Schemes to Reduce Risk of Extinction in the Lotka-Volterra Predator-Prey Model
Journal of Applied Mathematics and Phsics, 2014, 2, 644-652 Published Online June 2014 in SciRes. http://www.scirp.org/journal/jamp http://d.doi.org/10.4236/jamp.2014.27071 Control Schemes to Reduce Risk
More informationMath Review Packet #5 Algebra II (Part 2) Notes
SCIE 0, Spring 0 Miller Math Review Packet #5 Algebra II (Part ) Notes Quadratic Functions (cont.) So far, we have onl looked at quadratic functions in which the term is squared. A more general form of
More informationH.Algebra 2 Summer Review Packet
H.Algebra Summer Review Packet 1 Correlation of Algebra Summer Packet with Algebra 1 Objectives A. Simplifing Polnomial Epressions Objectives: The student will be able to: Use the commutative, associative,
More informationA NOVEL MULTIPLE PSEUDO RANDOM BITS GENERATOR BASED ON SPATIOTEMPORAL CHAOS. Ping Li,1 Zhong Li Wolfgang. A. Halang Guanrong Chen
A OVEL MULTIPLE PSEUDO RADOM BITS GEERATOR BASED O SPATIOTEMPORAL CHAOS Ping Li, Zhong Li Wolfgang. A. Halang Guanrong Chen Faculty of Electrical and Computer Engineering, FernUniversität in Hagen, 884
More informationSimulation and Experimental Validation of Chaotic Behavior of Airflow in a Ventilated Room
Simulation and Eperimental Validation of Chaotic Behavior of Airflow in a Ventilated Room Jos van Schijndel, Assistant Professor Eindhoven Universit of Technolog, Netherlands KEYWORDS: Airflow, chaos,
More informationREVIEW ARTICLE. ZeraouliaELHADJ,J.C.SPROTT
Front. Phs. China, 2009, 4(1: 111 121 DOI 10.1007/s11467-009-0005- REVIEW ARTICLE ZeraouliaELHADJ,J.C.SPROTT Classification of three-dimensional quadratic diffeomorphisms with constant Jacobian c Higher
More information2.3 Quadratic Functions
88 Linear and Quadratic Functions. Quadratic Functions You ma recall studing quadratic equations in Intermediate Algebra. In this section, we review those equations in the contet of our net famil of functions:
More informationPHASE SPACE TOMOGRAPHY OF BEAMS WITH EXTREME SPACE CHARGE *
PHASE SPACE TOMOGRAPHY OF BEAMS WITH EXTREME SPACE CHARGE * D. Stratakis #, R. A. Kishek, I. Haber, M. Walter, R. B. Fiorito, S. Bernal, J.C.T. Thangaraj, K. Tian, C. Papadopoulos, M. Reiser, P. G. O Shea
More information11.4 Polar Coordinates
11. Polar Coordinates 917 11. Polar Coordinates In Section 1.1, we introduced the Cartesian coordinates of a point in the plane as a means of assigning ordered pairs of numbers to points in the plane.
More information8.4. If we let x denote the number of gallons pumped, then the price y in dollars can $ $1.70 $ $1.70 $ $1.70 $ $1.
8.4 An Introduction to Functions: Linear Functions, Applications, and Models We often describe one quantit in terms of another; for eample, the growth of a plant is related to the amount of light it receives,
More informationAlgebra 2 CPA Summer Assignment 2018
Algebra CPA Summer Assignment 018 This assignment is designed for ou to practice topics learned in Algebra 1 that will be relevant in the Algebra CPA curriculum. This review is especiall important as ou
More informationSecondary Mathematics 2 Table of Contents
Secondar Mathematics Table of Contents Unit 1: Etending the Number Sstem Cluster 1: Etending Properties of Eponents (N.RN.1 and N.RN.)... 3 Cluster : Using Properties of Rational and Irrational Numbers
More informationUC San Francisco UC San Francisco Previously Published Works
UC San Francisco UC San Francisco Previousl Published Works Title Radiative Corrections and Quantum Chaos. Permalink https://escholarship.org/uc/item/4jk9mg Journal PHYSICAL REVIEW LETTERS, 77(3) ISSN
More informationDynamics of multiple pendula without gravity
Chaotic Modeling and Simulation (CMSIM) 1: 57 67, 014 Dnamics of multiple pendula without gravit Wojciech Szumiński Institute of Phsics, Universit of Zielona Góra, Poland (E-mail: uz88szuminski@gmail.com)
More informationAdditional Material On Recursive Sequences
Penn State Altoona MATH 141 Additional Material On Recursive Sequences 1. Graphical Analsis Cobweb Diagrams Consider a generic recursive sequence { an+1 = f(a n ), n = 1,, 3,..., = Given initial value.
More informationLESSON #42 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART 2 COMMON CORE ALGEBRA II
LESSON #4 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART COMMON CORE ALGEBRA II You will recall from unit 1 that in order to find the inverse of a function, ou must switch and and solve for. Also,
More informationThe American School of Marrakesh. Algebra 2 Algebra 2 Summer Preparation Packet
The American School of Marrakesh Algebra Algebra Summer Preparation Packet Summer 016 Algebra Summer Preparation Packet This summer packet contains eciting math problems designed to ensure our readiness
More informationx y plane is the plane in which the stresses act, yy xy xy Figure 3.5.1: non-zero stress components acting in the x y plane
3.5 Plane Stress This section is concerned with a special two-dimensional state of stress called plane stress. It is important for two reasons: () it arises in real components (particularl in thin components
More informationVibrational Power Flow Considerations Arising From Multi-Dimensional Isolators. Abstract
Vibrational Power Flow Considerations Arising From Multi-Dimensional Isolators Rajendra Singh and Seungbo Kim The Ohio State Universit Columbus, OH 4321-117, USA Abstract Much of the vibration isolation
More informationUsing MatContM in the study of a nonlinear map in economics
Journal of Phsics: Conference Series PAPER OPEN ACCESS Using MatContM in the stud of a nonlinear map in economics To cite this article: Niels Neirnck et al 016 J. Phs.: Conf. Ser. 69 0101 Related content
More information5.6 RATIOnAl FUnCTIOnS. Using Arrow notation. learning ObjeCTIveS
CHAPTER PolNomiAl ANd rational functions learning ObjeCTIveS In this section, ou will: Use arrow notation. Solve applied problems involving rational functions. Find the domains of rational functions. Identif
More informationLinear Equations and Arithmetic Sequences
CONDENSED LESSON.1 Linear Equations and Arithmetic Sequences In this lesson, ou Write eplicit formulas for arithmetic sequences Write linear equations in intercept form You learned about recursive formulas
More informationUnit 3 NOTES Honors Common Core Math 2 1. Day 1: Properties of Exponents
Unit NOTES Honors Common Core Math Da : Properties of Eponents Warm-Up: Before we begin toda s lesson, how much do ou remember about eponents? Use epanded form to write the rules for the eponents. OBJECTIVE
More informationPolynomial and Rational Functions
Name Date Chapter Polnomial and Rational Functions Section.1 Quadratic Functions Objective: In this lesson ou learned how to sketch and analze graphs of quadratic functions. Important Vocabular Define
More informationChaos and Cryptography
Chaos and Cryptography Vishaal Kapoor December 4, 2003 In his paper on chaos and cryptography, Baptista says It is possible to encrypt a message (a text composed by some alphabet) using the ergodic property
More information8. BOOLEAN ALGEBRAS x x
8. BOOLEAN ALGEBRAS 8.1. Definition of a Boolean Algebra There are man sstems of interest to computing scientists that have a common underling structure. It makes sense to describe such a mathematical
More informationRegular Physics - Notes Ch. 1
Regular Phsics - Notes Ch. 1 What is Phsics? the stud of matter and energ and their relationships; the stud of the basic phsical laws of nature which are often stated in simple mathematical equations.
More informationLESSON #48 - INTEGER EXPONENTS COMMON CORE ALGEBRA II
LESSON #8 - INTEGER EXPONENTS COMMON CORE ALGEBRA II We just finished our review of linear functions. Linear functions are those that grow b equal differences for equal intervals. In this unit we will
More informationScattering Properties of Gas Molecules on a Water Adsorbed Surface
Scattering Properties of Gas Molecules on a Water Adsorbed Surface Hideki Takeuchi a, Koji Yamamoto b, and Toru Hakutake c a Department of Mechanical Engineering, Kochi National College of Technolog, Nankoku
More information1.6 CONTINUITY OF TRIGONOMETRIC, EXPONENTIAL, AND INVERSE FUNCTIONS
.6 Continuit of Trigonometric, Eponential, and Inverse Functions.6 CONTINUITY OF TRIGONOMETRIC, EXPONENTIAL, AND INVERSE FUNCTIONS In this section we will discuss the continuit properties of trigonometric
More information520 Chapter 9. Nonlinear Differential Equations and Stability. dt =
5 Chapter 9. Nonlinear Differential Equations and Stabilit dt L dθ. g cos θ cos α Wh was the negative square root chosen in the last equation? (b) If T is the natural period of oscillation, derive the
More informationThe Force Table Introduction: Theory:
1 The Force Table Introduction: "The Force Table" is a simple tool for demonstrating Newton s First Law and the vector nature of forces. This tool is based on the principle of equilibrium. An object is
More information7-6. nth Roots. Vocabulary. Geometric Sequences in Music. Lesson. Mental Math
Lesson 7-6 nth Roots Vocabular cube root n th root BIG IDEA If is the nth power of, then is an nth root of. Real numbers ma have 0, 1, or 2 real nth roots. Geometric Sequences in Music A piano tuner adjusts
More informationOn the design of Incremental ΣΔ Converters
M. Belloni, C. Della Fiore, F. Maloberti, M. Garcia Andrade: "On the design of Incremental ΣΔ Converters"; IEEE Northeast Workshop on Circuits and Sstems, NEWCAS 27, Montreal, 5-8 August 27, pp. 376-379.
More informationChapter 6: Securing neighbor discovery
Securit and Cooperation in Wireless Networks http://secowinet.epfl.ch/ the wormhole attack; centralized and decentralized wormhole detection mechanisms; 007 Levente Buttán and Jean-Pierre Hubau Introduction
More informationOn the Missing Modes When Using the Exact Frequency Relationship between Kirchhoff and Mindlin Plates
On the Missing Modes When Using the Eact Frequenc Relationship between Kirchhoff and Mindlin Plates C.W. Lim 1,*, Z.R. Li 1, Y. Xiang, G.W. Wei 3 and C.M. Wang 4 1 Department of Building and Construction,
More informationReview of Essential Skills and Knowledge
Review of Essential Skills and Knowledge R Eponent Laws...50 R Epanding and Simplifing Polnomial Epressions...5 R 3 Factoring Polnomial Epressions...5 R Working with Rational Epressions...55 R 5 Slope
More informationSection 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y
Paul J. Bruillard MATH 0.970 Problem Set 6 An Introduction to Abstract Mathematics R. Bond and W. Keane Section 3.1: 3b,c,e,i, 4bd, 6, 9, 15, 16, 18c,e, 19a, 0, 1b Section 3.: 1f,i, e, 6, 1e,f,h, 13e,
More informationBES with FEM: Building Energy Simulation using Finite Element Methods
BES with FEM: Building Energ Simulation using Finite Element Methods A.W.M. (Jos) van Schijndel Eindhoven Universit of Technolog P.O. Bo 513; 5600 MB Eindhoven; Netherlands, A.W.M.v.Schijndel@tue.nl Abstract:
More informationNew Chaotic Permutation Methods for Image Encryption
IAENG International Journal of Computer Science, 37:4, IJCS_37_4_ New Chaotic Permutation Methods for Image Encryption Abir Awad, Abdelhakim Saadane 2 Abstract Since two decades, and in order to reach
More information2.5 CONTINUITY. a x. Notice that Definition l implicitly requires three things if f is continuous at a:
SECTION.5 CONTINUITY 9.5 CONTINUITY We noticed in Section.3 that the it of a function as approaches a can often be found simpl b calculating the value of the function at a. Functions with this propert
More informationChapter 11. Correlation and Regression
Chapter 11 Correlation and Regression Correlation A relationship between two variables. The data can be represented b ordered pairs (, ) is the independent (or eplanator) variable is the dependent (or
More informationChapter 8 Notes SN AA U2C8
Chapter 8 Notes SN AA U2C8 Name Period Section 8-: Eploring Eponential Models Section 8-2: Properties of Eponential Functions In Chapter 7, we used properties of eponents to determine roots and some of
More informationPhysics Gravitational force. 2. Strong or color force. 3. Electroweak force
Phsics 360 Notes on Griffths - pluses and minuses No tetbook is perfect, and Griffithsisnoeception. Themajorplusisthat it is prett readable. For minuses, see below. Much of what G sas about the del operator
More informationChapter Adequacy of Solutions
Chapter 04.09 dequac of Solutions fter reading this chapter, ou should be able to: 1. know the difference between ill-conditioned and well-conditioned sstems of equations,. define the norm of a matri,
More informationProperties of Limits
33460_003qd //04 :3 PM Page 59 SECTION 3 Evaluating Limits Analticall 59 Section 3 Evaluating Limits Analticall Evaluate a it using properties of its Develop and use a strateg for finding its Evaluate
More informationSimultaneous Orthogonal Rotations Angle
ELEKTROTEHNIŠKI VESTNIK 8(1-2): -11, 2011 ENGLISH EDITION Simultaneous Orthogonal Rotations Angle Sašo Tomažič 1, Sara Stančin 2 Facult of Electrical Engineering, Universit of Ljubljana 1 E-mail: saso.tomaic@fe.uni-lj.si
More informationAlgebra 2 Honors Summer Packet 2018
Algebra Honors Summer Packet 018 Solving Linear Equations with Fractional Coefficients For these problems, ou should be able to: A) determine the LCD when given two or more fractions B) solve a linear
More informationy = f(x + 4) a) Example: A repeating X by using two linear equations y = ±x. b) Example: y = f(x - 3). The translation is
Answers Chapter Function Transformations. Horizontal and Vertical Translations, pages to. a h, k h, k - c h -, k d h 7, k - e h -, k. a A (-,, B (-,, C (-,, D (,, E (, A (-, -, B (-,, C (,, D (, -, E (,
More informationOn Range and Reflecting Functions About the Line y = mx
On Range and Reflecting Functions About the Line = m Scott J. Beslin Brian K. Heck Jerem J. Becnel Dept.of Mathematics and Dept. of Mathematics and Dept. of Mathematics and Computer Science Computer Science
More informationQuantum Computer Algorithms: basics
Quantum Computer Algorithms: basics Michele Mosca Canada Research Chair in Quantum Computation SQUINT Summer School on Quantum Information Processing June 3 Overview A quantum computing model Basis changes
More informationRELATIONS AND FUNCTIONS through
RELATIONS AND FUNCTIONS 11.1.2 through 11.1. Relations and Functions establish a correspondence between the input values (usuall ) and the output values (usuall ) according to the particular relation or
More informationExponential and Logarithmic Functions
7 Eponential and Logarithmic Functions In this chapter ou will stud two tpes of nonalgebraic functions eponential functions and logarithmic functions. Eponential and logarithmic functions are widel used
More informationHÉNON HEILES HAMILTONIAN CHAOS IN 2 D
ABSTRACT HÉNON HEILES HAMILTONIAN CHAOS IN D MODELING CHAOS & COMPLEXITY 008 YOUVAL DAR PHYSICS DAR@PHYSICS.UCDAVIS.EDU Chaos in two degrees of freedom, demonstrated b using the Hénon Heiles Hamiltonian
More information