Non-Strange Chaotic Attractors Equivalent to Their Templates

Total Page:16

File Type:pdf, Size:1020Kb

Non-Strange Chaotic Attractors Equivalent to Their Templates Non-strange chaotic attractors equivalent to their templates John Starrett Department of Mathematics New Mexico Institute of Mining and Technology 801 Leroy Place, Socorro NM, 87801 USA We construct systems of three autonomous ¯rst order di®erential equations with bounded two- dimensional attracting sets M. The flows on M are chaotic and have one dimensional Poincar¶e sections whose Poincar¶emaps are di®eomorphic to maps of the interval. The attractors are two dimensional rather than fractal, and when \unzipped" they are topologically equivalent to the templates of suspended horseshoes. INTRODUCTION The analysis of the dynamics of chaotic systems can be broken roughly into two parts { the quantitative, which emphasizes measures such as Lyapunov exponents, frac- tal dimensions and power spectra [1], and the topological, where qualitative characterizations such as templates and bounding tori are considered [2]. When we think of the in¯nite set of unstable periodic orbits in a strange at- tractor as topological knots, the topology of the attrac- tor can be coded in the set of links the dynamics allows. The primary tool is a template, a construction due to Birman and Williams [3] [4], a branched two-manifold that results when the attractor is collapsed along its sta- FIG. 1: On the left, a portion of a chaotic orbit of the Rossler ble manifolds. The template supports a semi-flow which system, on the right, a template for the Rossler system with counterclockwise flow corresponding to counterclockwise flow contains the same periodic orbits as the original system, about the z axis in the attractor. with at most two additional extraneous orbits. Extracting a template from a strange attractor is a relatively straightforward, but inexact process. In the ical system whose attractor is one-dimensional. Such an simplest cases, one can guess the form of the template attractor cannot be called \strange" because it does not by making a visual inspection of the attractor and its have a fractal structure. The two-dimensional maps we Poincar¶esections to try to determine how the stretch- suspend are di®eomorphic to one-dimensional maps. Be- ing and folding is taking place, see Fig. (1). Once a cause the exact Poincar¶emap dynamics are known, such template structure is proposed, the knots and links that continuous chaotic systems might be useful test beds for are supported by that structure can be determined. One understanding the behavior of map based and continuous then attempts to verify that the periodic orbits corre- chaos control methods, and other areas where the rela- sponding to these topological knots and links exist in the tion of a Poincar¶emap to its flow might be useful. Also, dynamics of the original system. This veri¯cation pro- these attractors are the in¯nite dissipation limiting case cess is the source of the inexactness: one never knows of families of strange attractors. if one has checked a su±ciently large set of orbits. For more complicated systems, one can extract a set of peri- odic orbits by the method of close returns or by Pyragas SUSPENDING MAPS TO FLOWS [5] or similar chaos control methods [6], and determine a set of topological invariants such as linking numbers The ¯rst detailed exposition of the conditions that and relative rotation rates for these orbits. One can then must hold for an explicit suspension of a map to a flow construct a template based on symbolic dynamics given were given by Channell [8]. Mayer-Kress and Haken [9] to the orbits [7]. suspended a H¶enonmap to a cylinder R2 £ I, but the Because template construction can sometimes be a dif- resulting di®erential equations could not be integrated ¯cult iterative process, it is an interesting exercise to con- forward normally: the integrator must reset t whenever struct an explicit chaotic dynamical system in the form t = 1 and load in the ¯nal conditions at t = 1 as the of a system of three autonomous di®erential equations new initial conditions each time. Recently Nicholas[10] whose dynamics actually take place on a template. Our described a method for making an exact autonomous approach is to suspend a two-dimensional chaotic dynam- suspension of a map in an open half plane to a flow. 2 by · ¸ · ¸ x^ ¡F n+1 = 2 ; (4) z^n+1 F1 then the result is rotated by ¼=2 clockwise · ¸ · ¼ ¼ ¸ · ¸ · ¸ xn+1 cos( 2 ) sin( 2 ) ¡F2 F1 = ¼ ¼ = : (5) zn+1 ¡ sin( ) cos( ) F1 F2 FIG. 2: Left to right, the attractors of the quadratic map, 2 2 logistic map and cubic map, in black, along with the rotated We suspend the maps to flows by continuous interpola- functions along which the attractors lie, in gray. tions between initial and ¯nal conditions. The interpola- tion is performed using the basic interpolating functions C = cos( ¼ t) and S = sin( ¼ t), which also appear in a 2 · 2 ¸ The construction embeds a flow on a quotient space CS Q = R2 £ [0; 1]= », where 0 and 1 are identi¯ed in rotation matrix R = . As interpolating di®eo- 3 ¡SC [0; 1], in R by wrapping it around the z axis. More morphisms, these are exactly, the flow Á on Q~ = R2 £ S1 is embedded in R3 2 3 ³¼ ´ by truncating R to (¡a; 1) £ R and constructing R C2 = cos2 t (6) as (0; 0; z) [F((¡a; 1) £ R), where F((¡a; 1) £ R) is ³ 2 ´ 3 ¼ a book-leaf foliation of R =(0; 0; z) rotationally symmet- S2 = sin2 t (7) ric about the z axis. The method in [10] was demon- 2 strated on two-dimensional maps with strange attractors, taking initial to ¯nal conditions by C2x +S2x as t varies a H¶enonand a Du±ng map. While this method only sus- 0 1 from 0 to 1. Because of the scaling of the argument, a pends the dynamics in the right half plane, it produces a quarter clockwise rotation and a smooth interpolation system of di®erential equations that can be integrated in between initial and ¯nal conditions is accomplished as t a normal fashion. We use this method to suspend two- goes from 0 to 1, and this suspends the map to a cylinder dimensional maps with one-dimensional attracting sets, R2 £ I. resulting in attractors with no fractal structure, but with In anticipation of our embedding in R3, we write the veri¯able chaotic dynamics. suspension to a cylinder R2 £ I as Consider the di®erence equations 2 3 2 32 2 2 3 6 x 7 6 C 0 S 76 C x0 ¡ S F2 7 6 7 6 76 7 6 7 6 76 7 2 6 7=6 76 7= xn+1 = 4=3 ¡ 5=4 xn + ®zn zn+1 = ¡xn (1) 6 y 7 6 0 1 0 76 0 7 4 5 4 54 2 2 5 z ¡S 0 C C z0 + S F1 xn+1 = 4 xn(1 ¡ xn) + ®zn zn+1 = ¡xn (2) x = ¡13=5 x + x3 + ®z z = ¡x (3) n+1 n n n n+1 n 2 3 2 3 ¡Cx0 + SC z0 + S F1 where the ¯rst and last are analogs of the H¶enonand = 4 0 5 ; (8) 3 2 Du±ng maps, and the middle a two-dimensional version ¡Sx0 + C z0 + CS F1 of the logistic map. For a range of parameter ®, these systems are chaotic with fractal attractors. For ® = 0, where we have used the fact that F2 = ¡x. 3 these maps have one-dimensional attractors in the x; z In order to embed this in R , we displace the function plane because the points of the iteration are of the form in the x direction by an amount (in this case 1) su±cient to include the attractor in the left half plane and to avoid (xn+1; ¡xn), a clockwise rotation of the functional form ¼ self-intersection, and rotate counterclockwise about the of the map (xn; xn+1) by 2 . Thus, the exact functional form of the attracting sets are known, and the projection z axis: of the dynamics onto the x axis give the dynamics of the · ¸ · ¸ original one-dimensional map. h i 2 3 x cos(2¼t) ¡ sin(2¼t) 0 1+Cx0+SC z0+S F1 y = sin(2¼t) cos(2¼t) 0 0 = z 3 2 0 0 1 ¡Sx0+C z0+CS F1 2 3 THE EXPLICIT SUSPENSION 2 3 cos(2¼t)(1 + Cx0 + SC z0 + S F1) 2 3 = 4 sin(2¼t)(1 + Cx0 + SC z0 + S F1) 5 : (9) 3 2 Let xn+1 = F1; zn+1 = F2 = ¡xn be the components ¡Sx0 + C z0 + CS F1 of our two-dimensional mappings of the plane. Then the action of the maps can be broken down into two geomet- To form a di®erential equation we solve (8) for the ini- rically distinct steps. First the (x; z) plane is deformed tial conditions in terms of the variables x and z, take 3 the derivative of (9) with respect to the interpolating pa- rameter t, and substitute the expressions for the initial conditions into the di®erential equation. At this point we have non-autonomous di®erential equations. To make them autonomous, we use the half angle formulas twice to write all interpolation and rota- tion operators in a form so that their period is 2¼t for t 2 [0; 1]. Thus, let ( q p 1 + 1 2+2 cos(2¼t) 0·t· 1 C = q 2 4 p 2 (10) 1 ¡ 1 2+2 cos(2¼t) 1 ·t·1 2 4 2 FIG.
Recommended publications
  • FPGA Design of Encryption Speech System Using Synchronized Fixed-Point Chaotic Maps Based Stream Ciphers
    International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Volume-8 Issue-6, August 2019 FPGA Design of Encryption Speech system using Synchronized Fixed-Point Chaotic Maps Based Stream Ciphers Zahraa M. Alroubaie, Muneer A. Hashem, Fadhil S. Hasan Abstract: In this work, speech encryption using synchronized Nowadays, Unpredictable long-term assessment of fixed-point chaotic map-based stream ciphers (SFPCM-SC) is chaotic systems has been appeared, initial parameters suggested. Five chaotic maps named quadratic, henon, logistic, sensitivity and infinite period, that the usage make them lozi and duffing are synchronized by using master-slave suitable in pseudo random bit generator [10],[14] and synchronization technique and then used to generate the pseudo permutation [15]. Therefore, different researchers are random bit generator (PRBG) using fixed-point converter. The PRBG is then Xor-ed with digitized speech signal where the suggested the chaotic system in stream ciphers-based speech encrypted signal is created. In the other side, the same map is encryption system. In [1] Lorenz chaotic system and Henon synchronized with the master one and used to recover the map in hybrid discrete continuous chaotic system for real original speech signal. First this work is simulated by using time wireless speech encryption are used. In [16] the chaotic MATLAB and then built the design using Xilinx system system is synchronized using the same manner described in generator (XSG). Finally, the hardware co-simulation is applied chaotic masking system. Furthermore, the proposed cipher for the proposed system by using FPGA SP605 XC6SLX45T speech system is implemented using FPGA Virtex-II device.
    [Show full text]
  • Empirical Analysis of Robust Chaotic Maps for Image Encryption
    International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-9 Issue-11, September 2020 Empirical Analysis of Robust Chaotic Maps for Image Encryption Sonal Ayyappan, C Lakshmi Abstract: The rate of transferring data in the form of text, image, video or audio over an open network has drastically increased. As these are carried out in highly sophisticated fields of medicine, military and banking, security becomes important. In- order to enhance security for transmission, encryption algorithms play a vital role. So as to enhance the proficiency of the existing Images are represented as 2-dimensional arrays of encryption methods and for stronger anti attack abilities, chaotic data. Hence to apply encryption algorithms it must be based cryptography is essential. Chaotic based encryption has considered as one-dimensional array of data[3]. One- advantages of being sensitive to initial conditions and control parameters. Images have features like bulk data capacity and high dimensional image array consumes more space when inter pixel correlation. Transmission of such medical data should compared to one dimensional text data which leads to be highly confidential, integral and authorized. Hence chaos-based compression. It results in reduced space and reduced time for image encryption is an efficient way of fast and high-quality image transmission. But this may cause loss of some data which encryption. It has features like good speed, complexity, highly may be agreeable for general images but may be costly for secure, reasonable computational overhead and power. In this medical images. This results to wrong diagnosis of these paper a comprehensive analysis and an evaluation regarding the medical images [4].
    [Show full text]
  • Generalized Chaotic Maps and Elementary Functions Between Analysis and Implementation
    GENERALIZED CHAOTIC MAPS AND ELEMENTARY FUNCTIONS BETWEEN ANALYSIS AND IMPLEMENTATION By Wafaa Saber AbdelHalim Sayed A Thesis Submitted to the Faculty of Engineering at Cairo University in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in Mathematical Engineering FACULTY OF ENGINEERING, CAIRO UNIVERSITY GIZA, EGYPT 2015 GENERALIZED CHAOTIC MAPS AND ELEMENTARY FUNCTIONS BETWEEN ANALYSIS AND IMPLEMENTATION By Wafaa Saber AbdelHalim Sayed A Thesis Submitted to the Faculty of Engineering at Cairo University in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in Mathematical Engineering Under the Supervision of Prof. Abdel-Latif E. Hussien Prof. Hossam A. H. Fahmy Professor Professor Engineering Mathematics and Physics Department Electronics and Communication Engineering Department Faculty of Engineering, Cairo University Faculty of Engineering, Cairo University Assoc. Prof. Ahmed G. Radwan Associate Professor Engineering Mathematics and Physics Department Faculty of Engineering, Cairo University FACULTY OF ENGINEERING, CAIRO UNIVERSITY GIZA, EGYPT 2015 GENERALIZED CHAOTIC MAPS AND ELEMENTARY FUNCTIONS BETWEEN ANALYSIS AND IMPLEMENTATION By Wafaa Saber AbdelHalim Sayed A Thesis Submitted to the Faculty of Engineering at Cairo University in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in Mathematical Engineering Approved by the Examining Committee: Prof. Abdel-Latif E. Hussien, Thesis Main Advisor Prof. Hossam A. H. Fahmy, Member Assoc. Prof. Ahmed G. Radwan, Member Prof. Salwa K. Abd-El-Hafiz, Internal Examiner Prof. Nasser H. Sweilam, External Examiner Professor, Faculty of Science, Cairo University FACULTY OF ENGINEERING, CAIRO UNIVERSITY GIZA, EGYPT 2015 Engineer’s Name: Wafaa Saber AbdelHalim Sayed Date of Birth: 20/3/1991 Nationality: Egyptian E-mail: [email protected] Registration Date: 1/10/2013 Awarding Date: –/–/2015 Degree: Master of Science Department: Engineering Mathematics and Physics Supervisors: Prof.
    [Show full text]
  • Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map
    Hindawi Publishing Corporation e Scientific World Journal Volume 2014, Article ID 283639, 11 pages http://dx.doi.org/10.1155/2014/283639 Research Article Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map Borislav Stoyanov and Krasimir Kordov Faculty of Mathematics and Informatics, Konstantin Preslavski University of Shumen, 9712 Shumen, Bulgaria Correspondence should be addressed to Borislav Stoyanov; [email protected] Received 10 December 2013; Accepted 4 March 2014; Published 26 March 2014 Academic Editors: T. Cao, M. K. Khan, and F. Yu Copyright © 2014 B. Stoyanov and K. Kordov. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of 113 more than 10 key space and desirable level of security based on the good statistical results and theoretical arguments. 1. Introduction chaotic cryptographic algorithm with good complex struc- ture is designed [5]. In [6], an improved stochastic middle In recent years, the dynamical chaotic systems have been multibits quantification algorithm based on Chebyshev poly- commonly used for the design of cryptographic primitives nomial is proposed. Three-party key agreement protocols featuring chaotic behaviour and random-like properties.
    [Show full text]
  • The Dynamics of the Fixed Points to Duffing Map
    Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.7, 2013 The Dynamics of the Fixed Points to Duffing Map Iftichar M.T.AL-Shara'a 1 May Alaa Abdul-khaleq AL-Yaseen 2* Mathematics Department ,University of Babylon ,Hilla , Babylon, Iraq * E-mail of the corresponding author : [email protected] Abstract We study the fixed points of Duffing map and the general properties of them , we find the contracting and expanding area of this map .So, we divide the parameter space for many regions to determinate the fixed points attracting , repelling or saddle . Also we determinate the bifurcation points of the parameter space . Keywords: Duffing map , fixed point , bifurcation point , attracting- expanding area. 1. Introduction Chaos Theory is a synonym for dynamical systems theory, a branch of mathematics. Dynamical systems come in three flavors: flows (continuous dynamical systems), cascades (discrete, reversible, dynamical systems), and semi-cascades (discrete, irreversible, dynamical systems).The concept of a dynamical system has its origins in Newtonian mechanics. There, as in other natural sciences and engineering disciplines, the evolution rule of dynamical systems is given implicitly by a relation that gives the state of the system only a short time into the future.In a dynamical system, a bifurcation is a period doubling, quadrupling, etc., that accompanies the onset of chaos. It represents the sudden appearance of a qualitatively different solution for a nonlinear system as some parameter is varied. Most commonly applied to the mathematical study of dynamical systems, a bifurcation occurs when a small smooth change made to the parameter values (the bifurcation parameters) of a system causes a sudden 'qualitative' or topological change in its behaviour.
    [Show full text]
  • A Period-Doubling Cascade Precedes Chaos for Planar Maps Evelyn Sander and James A
    A period-doubling cascade precedes chaos for planar maps Evelyn Sander and James A. Yorke Citation: Chaos 23, 033113 (2013); doi: 10.1063/1.4813600 View online: http://dx.doi.org/10.1063/1.4813600 View Table of Contents: http://chaos.aip.org/resource/1/CHAOEH/v23/i3 Published by the AIP Publishing LLC. Additional information on Chaos Journal Homepage: http://chaos.aip.org/ Journal Information: http://chaos.aip.org/about/about_the_journal Top downloads: http://chaos.aip.org/features/most_downloaded Information for Authors: http://chaos.aip.org/authors CHAOS 23, 033113 (2013) A period-doubling cascade precedes chaos for planar maps Evelyn Sander1,a) and James A. Yorke2,b) 1Department of Mathematical Sciences, George Mason University, 4400 University Dr., Fairfax, Virginia 22030, USA 2University of Maryland, College Park, Maryland 20742, USA (Received 25 April 2013; accepted 27 June 2013; published online 22 July 2013) A period-doubling cascade is often seen in numerical studies of those smooth (one-parameter families of) maps for which as the parameter is varied, the map transitions from one without chaos to one with chaos. Our emphasis in this paper is on establishing the existence of such a cascade for many maps with phase space dimension 2. We use continuation methods to show the following: under certain general assumptions, if at one parameter there are only finitely many periodic orbits, and at another parameter value there is chaos, then between those two parameter values there must be a cascade. We investigate only families that are generic in the sense that all periodic orbit bifurcations are generic.
    [Show full text]
  • An Algorithm to Automatically Detect the Smale Horseshoes
    Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 2012, Article ID 283179, 9 pages doi:10.1155/2012/283179 Research Article An Algorithm to Automatically Detect the Smale Horseshoes Qingdu Li,1, 2 Lina Zhang,2 and Fangyan Yang2 1 Key Laboratory of Network Control & Intelligent Instrument of Ministry of Education, Chongqing University of Posts and Telecommunications, Chongqing 400065, China 2 Institute for Nonlinear Circuits and Systems, Chongqing University of Posts and Telecommunications, Chongqing 400065, China Correspondence should be addressed to Qingdu Li, [email protected] Received 9 August 2011; Revised 10 November 2011; Accepted 15 December 2011 Academic Editor: Nikos I. Karachalios Copyright q 2012 Qingdu Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Smale horseshoes, curvilinear rectangles and their U-shaped images patterned on Smale’s famous example, provide a rigorous way to study chaos in dynamical systems. The paper is devoted to constructing them in two-dimensional diffeomorphisms with the existence of transversal homoclinic saddles. We first propose an algorithm to automatically construct “horizontal” and “vertical” sides of the curvilinear rectangle near to segments of the stable and of the unstable manifolds, respectively, and then apply it to four classical chaotic maps the Duffing map, the Henon´ map, the Ikeda map, and the Lozi map to verify its effectiveness. 1. Introduction Among a variety of mathematical characteristics of chaos, the existence of a horseshoe by S. Smale has been recognized as the most important signature of chaos from geometrical point of view.
    [Show full text]
  • Lie Methods for Nonlinear Dynamics with Applications to Accelerator Physics
    Lie Methods for Nonlinear Dynamics with Applications to Accelerator Physics Alex J. Dragt University of Maryland, College Park http://www.physics.umd.edu/dsat/ RSIT VE Y I O N F U 18 56 M A D N R Y L A 1 June 2019 Alex J. Dragt Dynamical Systems and Accelerator Theory Group Department of Physics University of Maryland College Park, Maryland 20742 http://www.physics.umd.edu/dsat Work supported in part by U.S. Department of Energy Grant DE-FG02-96ER40949. c 1991, 2014, and 2018 by Alex J. Dragt. All rights reserved. Contents Preface lxiii 1 Introductory Concepts 1 1.1 Transfer Maps ................................. 1 1.1.1 Maps and Dynamics ......................... 2 1.1.2 Maps and Accelerator Physics ................... 8 1.1.3 Maps and Geometry ......................... 9 1.2 Map Iteration and Other Background Material ............... 10 1.2.1 Logistic Map ............................. 10 1.2.2 Complex Logistic Map and the Mandelbrot Set .......... 18 1.2.3 Simplest Nonlinear Symplectic Map ................ 24 1.2.4 Goal for Use of Maps in Accelerator Physics ........... 27 1.2.5 Maps from Hamiltonian Di↵erential Equations .......... 32 1.3 Essential Theorems for Di↵erential Equations ................ 46 1.4 Transfer Maps Produced by Di↵erential Equations ............. 52 1.4.1 Map for Simple Harmonic Oscillator ................ 53 1.4.2 Maps for Monomial Hamiltonians ................. 54 1.4.3 Stroboscopic Maps and Duffing Equation Example ........ 55 1.5 Lagrangian and Hamiltonian Equations ................... 62 1.5.1 The Nonsingular Case ........................ 63 1.5.2 A Common Singular Case ...................... 65 1.6 Hamilton’s Equations with a Coordinate as an Independent Variable ..
    [Show full text]
  • Appendix a Classical Mechanics
    Appendix A Classical Mechanics In this Appendix we review some of the basic concepts from classical mechanics that are used in the text. A.1 Newton's Equations Newton's equations of motion describe the behavior of collections of N point particles in a three dimensional space (3N degrees of freedom) in terms of 3N coupled second order differential equations (the number of equations can be reduced if constraints are present), cf(mQrQ) _ F (A.1) dt2 - 01, where a = 1, ... , N, mo: is the mass and ro: is the displacement of the a th particle, and F 01 is the net force on the ath particle due to the other particles and any external fields that might be present. Eqs. (A.1) only have simple structure in inertial frames of reference and for Cartesian coordinates. For noninertial frames and general orthog­ onal curvilinear coordinate systems they rapidly become extremely complicated and nonintuitive. Because Newton's equations are second order, the state of a col­ lection of N particles at time t is determined once the velocities, VOl = ~ = rQ and displacements rQ are specified at time t. New­ ton's equations allow one to determine the state of the system at time, t, uniquely in terms of the state at time t=O Thus a system composed of N point particles evolves in a phase space composed of 3N velocity and 3N position coordinates. 460 Appendix A. Classical Mechanics A.2 Lagrange's Equations Lagrange showed that it is possible to formulate Newtonian mechan­ ics in terms of a variational principle which vastly simplifies the study of mechanical systems in curvilinear coordinates and nonin­ ertial frames and allows a straightforward extension to continuum mechanics.
    [Show full text]
  • A Chaotic-Based Encryption/Decryption Framework for Secure Multimedia Communications
    entropy Article A Chaotic-Based Encryption/Decryption Framework for Secure Multimedia Communications Ibrahim Yasser 1 , Mohamed A. Mohamed 2 , Ahmed S. Samra 2 and Fahmi Khalifa 2,* 1 Communications and Electronics Engineering Department, Nile Higher Institute for Engineering and Technology, Mansoura 35524, Egypt; [email protected] 2 Electronics and Communications Engineering Department, Faculty of Engineering, Mansoura University, Mansoura 35516, Egypt; [email protected] (M.A.M.); [email protected] (A.S.S.) * Correspondence: [email protected] Received: 10 September 2020; Accepted: 28 October 2020; Published: 4 November 2020 Abstract: Chaos-based encryption has shown an increasingly important and dominant role in modern multimedia cryptography compared with traditional algorithms. This work proposes novel chaotic-based multimedia encryption schemes utilizing 2D alteration models for high secure data transmission. A novel perturbation-based data encryption for both confusion and diffusion rounds is proposed. Our chaotification structure is hybrid, in which multiple maps are combined combines for media encryption. Blended chaotic maps are used to generate the control parameters for the permutation (shuffling) and diffusion (substitution) structures. The proposed schemes not only maintain great encryption quality reproduced by chaotic, but also possess other advantages, including key sensitivity and low residual clarity. Extensive security and differential analyses documented that the proposed schemes are efficient for secure multimedia transmission as well as the encrypted media possesses resistance to attacks. Additionally, statistical evaluations using well-known metrics for specific media types, show that proposed encryption schemes can acquire low residual intelligibility with excessive nice recovered statistics. Finally, the advantages of the proposed schemes have been highlighted by comparing it against different state-of-the-art algorithms from literature.
    [Show full text]
  • Kumari Meenu.Pdf (9.124Mb)
    Quantum-Classical Correspondence and Entanglement in Periodically Driven Spin Systems by Meenu Kumari A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Physics (Quantum Information) Waterloo, Ontario, Canada, 2019 c Meenu Kumari 2019 Examining Committee Membership The following served on the Examining Committee for this thesis. The decision of the Examining Committee is by majority vote. External Examiner: Karl-Peter Marzlin Professor, Dept. of Physics, St. Francis Xavier University Supervisor(s): Shohini Ghose Professor, Dept. of Physics and Computer Sci., Wilfrid Laurier University Robert B. Mann Professor, Dept. of Physics and Astronomy, University of Waterloo Internal Member: Norbert L¨utkenhaus Professor, Dept. of Physics and Astronomy, University of Waterloo Internal-External Member: Achim Kempf Professor, Dept. of Applied Mathematics, University of Waterloo Other Member(s): Eduardo Mart´ın-Mart´ınez Asst. Professor, Dept. of Applied Mathematics, University of Waterloo ii This thesis consists of material all of which I authored or co-authored: see Statement of Contributions included in the thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. iii Statement of Contributions This thesis is based on the following publications and forthcoming articles: • Chapters 2 and 3 are based on - M. Kumari and S. Ghose, Quantum-classical correspondence in the vicinity of pe- riodic orbits, Phys. Rev. E 97, 052209 (2018). • Chapter 4 is based on - M. Kumari and S. Ghose, Untangling entanglement and chaos, Phys.
    [Show full text]
  • Encrypting Digitized Voice Signals Using the Chaotic Behavior of a Nonlinear Discrete Time Dynamical System
    Proceedings of the World Congress on Engineering 2016 Vol I WCE 2016, June 29 - July 1, 2016, London, U.K. Encrypting Digitized Voice Signals using the Chaotic Behavior of a Nonlinear Discrete Time Dynamical System Manju Pandey chaotic dynamical behavior has some very interesting Abstract — A method for the encryption and decryption of statistical properties which make it well suited for the design voice signals using the chaotic dynamic behavior exhibited by a of hard-to-crack ciphers in cryptography. nonlinear discrete time dynamical system has been proposed. A In this paper, a method for the encryption of recorded chaotic cipher for digitized voice signals has been designed and digitized voice signals using the chaotic dynamics which is the encryption and decryption processes have been tested on a exhibited by a nonlinear discrete time dynamical system is sample voice signal, i.e., “hello”. The nonlinear discrete-time discussed. A proof-of-concept demonstration of the dynamical system considered for encryption in the present paper is the Duffing’s map which is a nonlinear differential encryption and decryption of a digitized voice signal using a equation of order two modeling an oscillator. chaotic cipher has been carried out by the author. Index Terms—Chaos, Nonlinear Dynamical System, Discrete II. CHAOTIC SEQUENCES Time Signal, Encryption and Decryption A. Chaotic Dynamics and Maps Chaotic dynamics is exhibited by certain nonlinear I. INTRODUCTION dynamical systems [2][3][4]. The dynamical behavior i.e., oluminous voice traffic moves over digital networks in the behavior with respect to time, of systems which exhibit Vthis era of ubiquitous multimedia and wireless chaos is extremely sensitive to even infinitesimal changes in communication.
    [Show full text]