Non-periodic bifurcations of one-dimensional maps

We prove that a 'positive probability' subset of the boundary of '{uniformly expanding circle transformations}' consists of Kupka-Smale maps. More precisely, we construct an open class of two-parameter families of circle maps (f(alpha,theta))(alpha,theta) such that, for a positive Lebesgue measure subset of values of alpha, the family (f(alpha,theta))(theta) crosses the boundary of the uniformly expanding domain at a map for which all periodic points are hyperbolic (expanding) and no critical point is pre-periodic. Furthermore, these maps admit an absolutely continuous invariant measure. We also provide information about the geometry of the boundary of the set of hyperbolic maps.

On properties of hyperchaos: Case study

Some properties of hyperchaos are exploited by studying both uncoupled and coupled CML. In addition to usual properties of chaotic strange attractors, there are other interesting properties, such as: the number of unstable periodic points embedded in the strange attractor increases dramatically increasing and a large number of low-dimensional chaotic invariant sets are contained in the strange attractor. These properties may be useful for regarding the edge of chaos as. the origin of complexity of dynamical systems.

Discussion on the geometric structure of strange attractor

We discuss the transversal heteroclinic cycle formed by hyperbolic periodic pointes of diffeomorphism on the differential manifold. We point out that every possible kind of transversal heteroclinic cycle has the Smalehorse property and the unstable manifolds of hyperbolic periodic points have the closure relation mutually. Therefore the strange attractor may be the closure of unstable manifolds of a countable number of hyperbolic periodic points. The Henon mapping is used as an example to show that the conclusion is reasonable.

The geometric structure and dynamic properties of lauwerier attractor

 Introduction The strange chaotic attractor (ACS) is an important subject in the nonlinear field. On the basis of the theory of transversal heteroclinic cycles, it is suggested that the strange attractor is the closure of the unstable manifolds of countable infinite hyperbolic periodic points. From this point of view some nonlinear phenomena are explained reasonably. 更多还原

Exercise sheet 1 pdf

Exercises and solutions in PDF

Exercise sheet 1

Exercises and solutions in LaTex

Exercise sheet 3

Exercises and solutions in LaTex

Exercise sheet 3 pdf

Exercises and solutions in PDF

Intersecções homoclínicas

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A survey on the set of periods of the graph homeomorphisms

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Contribución al estudio del criptoanálisis y diseño de los criptosistemas caóticos

The extraordinary increase of new information technologies, the development of Internet, the electronic commerce, the e-government, mobile telephony and future cloud computing and storage, have provided great benefits in all areas of society. Besides these, there are new challenges for the protection of information, such as the loss of confidentiality and integrity of electronic documents. Cryptography plays a key role by providing the necessary tools to ensure the safety of these new media. It is imperative to intensify the research in this area, to meet the growing demand for new secure cryptographic techniques. The theory of chaotic nonlinear dynamical systems and the theory of cryptography give rise to the chaotic cryptography, which is the field of study of this thesis. The link between cryptography and chaotic systems is still subject of intense study. The combination of apparently stochastic behavior, the properties of sensitivity to initial conditions and parameters, ergodicity, mixing, and the fact that periodic points are dense, suggests that chaotic orbits resemble random sequences. This fact, and the ability to synchronize multiple chaotic systems, initially described by Pecora and Carroll, has generated an avalanche of research papers that relate cryptography and chaos. The chaotic cryptography addresses two fundamental design paradigms. In the first paradigm, chaotic cryptosystems are designed using continuous time, mainly based on chaotic synchronization techniques; they are implemented with analog circuits or by computer simulation. In the second paradigm, chaotic cryptosystems are constructed using discrete time and generally do not depend on chaos synchronization techniques. The contributions in this thesis involve three aspects about chaotic cryptography. The first one is a theoretical analysis of the geometric properties of some of the most employed chaotic attractors for the design of chaotic cryptosystems. The second one is the cryptanalysis of continuos chaotic cryptosystems and finally concludes with three new designs of cryptographically secure chaotic pseudorandom generators. The main accomplishments contained in this thesis are: v Development of a method for determining the parameters of some double scroll chaotic systems, including Lorenz system and Chua’s circuit. First, some geometrical characteristics of chaotic system have been used to reduce the search space of parameters. Next, a scheme based on the synchronization of chaotic systems was built. The geometric properties have been employed as matching criterion, to determine the values of the parameters with the desired accuracy. The method is not affected by a moderate amount of noise in the waveform. The proposed method has been applied to find security flaws in the continuous chaotic encryption systems. Based on previous results, the chaotic ciphers proposed by Wang and Bu and those proposed by Xu and Li are cryptanalyzed. We propose some solutions to improve the cryptosystems, although very limited because these systems are not suitable for use in cryptography. Development of a method for determining the parameters of the Lorenz system, when it is used in the design of two-channel cryptosystem. The method uses the geometric properties of the Lorenz system. The search space of parameters has been reduced. Next, the parameters have been accurately determined from the ciphertext. The method has been applied to cryptanalysis of an encryption scheme proposed by Jiang. In 2005, Gunay et al. proposed a chaotic encryption system based on a cellular neural network implementation of Chua’s circuit. This scheme has been cryptanalyzed. Some gaps in security design have been identified. Based on the theoretical results of digital chaotic systems and cryptanalysis of several chaotic ciphers recently proposed, a family of pseudorandom generators has been designed using finite precision. The design is based on the coupling of several piecewise linear chaotic maps. Based on the above results a new family of chaotic pseudorandom generators named Trident has been designed. These generators have been specially designed to meet the needs of real-time encryption of mobile technology. According to the above results, this thesis proposes another family of pseudorandom generators called Trifork. These generators are based on a combination of perturbed Lagged Fibonacci generators. This family of generators is cryptographically secure and suitable for use in real-time encryption. Detailed analysis shows that the proposed pseudorandom generator can provide fast encryption speed and a high level of security, at the same time. El extraordinario auge de las nuevas tecnologías de la información, el desarrollo de Internet, el comercio electrónico, la administración electrónica, la telefonía móvil y la futura computación y almacenamiento en la nube, han proporcionado grandes beneficios en todos los ámbitos de la sociedad. Junto a éstos, se presentan nuevos retos para la protección de la información, como la suplantación de personalidad y la pérdida de la confidencialidad e integridad de los documentos electrónicos. La criptografía juega un papel fundamental aportando las herramientas necesarias para garantizar la seguridad de estos nuevos medios, pero es imperativo intensificar la investigación en este ámbito para dar respuesta a la demanda creciente de nuevas técnicas criptográficas seguras. La teoría de los sistemas dinámicos no lineales junto a la criptografía dan lugar a la ((criptografía caótica)), que es el campo de estudio de esta tesis. El vínculo entre la criptografía y los sistemas caóticos continúa siendo objeto de un intenso estudio. La combinación del comportamiento aparentemente estocástico, las propiedades de sensibilidad a las condiciones iniciales y a los parámetros, la ergodicidad, la mezcla, y que los puntos periódicos sean densos asemejan las órbitas caóticas a secuencias aleatorias, lo que supone su potencial utilización en el enmascaramiento de mensajes. Este hecho, junto a la posibilidad de sincronizar varios sistemas caóticos descrita inicialmente en los trabajos de Pecora y Carroll, ha generado una avalancha de trabajos de investigación donde se plantean muchas ideas sobre la forma de realizar sistemas de comunicaciones seguros, relacionando así la criptografía y el caos. La criptografía caótica aborda dos paradigmas de diseño fundamentales. En el primero, los criptosistemas caóticos se diseñan utilizando circuitos analógicos, principalmente basados en las técnicas de sincronización caótica; en el segundo, los criptosistemas caóticos se construyen en circuitos discretos u ordenadores, y generalmente no dependen de las técnicas de sincronización del caos. Nuestra contribución en esta tesis implica tres aspectos sobre el cifrado caótico. En primer lugar, se realiza un análisis teórico de las propiedades geométricas de algunos de los sistemas caóticos más empleados en el diseño de criptosistemas caóticos vii continuos; en segundo lugar, se realiza el criptoanálisis de cifrados caóticos continuos basados en el análisis anterior; y, finalmente, se realizan tres nuevas propuestas de diseño de generadores de secuencias pseudoaleatorias criptográficamente seguros y rápidos. La primera parte de esta memoria realiza un análisis crítico acerca de la seguridad de los criptosistemas caóticos, llegando a la conclusión de que la gran mayoría de los algoritmos de cifrado caóticos continuos —ya sean realizados físicamente o programados numéricamente— tienen serios inconvenientes para proteger la confidencialidad de la información ya que son inseguros e ineficientes. Asimismo una gran parte de los criptosistemas caóticos discretos propuestos se consideran inseguros y otros no han sido atacados por lo que se considera necesario más trabajo de criptoanálisis. Esta parte concluye señalando las principales debilidades encontradas en los criptosistemas analizados y algunas recomendaciones para su mejora. En la segunda parte se diseña un método de criptoanálisis que permite la identificaci ón de los parámetros, que en general forman parte de la clave, de algoritmos de cifrado basados en sistemas caóticos de Lorenz y similares, que utilizan los esquemas de sincronización excitador-respuesta. Este método se basa en algunas características geométricas del atractor de Lorenz. El método diseñado se ha empleado para criptoanalizar eficientemente tres algoritmos de cifrado. Finalmente se realiza el criptoanálisis de otros dos esquemas de cifrado propuestos recientemente. La tercera parte de la tesis abarca el diseño de generadores de secuencias pseudoaleatorias criptográficamente seguras, basadas en aplicaciones caóticas, realizando las pruebas estadísticas, que corroboran las propiedades de aleatoriedad. Estos generadores pueden ser utilizados en el desarrollo de sistemas de cifrado en flujo y para cubrir las necesidades del cifrado en tiempo real. Una cuestión importante en el diseño de sistemas de cifrado discreto caótico es la degradación dinámica debida a la precisión finita; sin embargo, la mayoría de los diseñadores de sistemas de cifrado discreto caótico no ha considerado seriamente este aspecto. En esta tesis se hace hincapié en la importancia de esta cuestión y se contribuye a su esclarecimiento con algunas consideraciones iniciales. Ya que las cuestiones teóricas sobre la dinámica de la degradación de los sistemas caóticos digitales no ha sido totalmente resuelta, en este trabajo utilizamos algunas soluciones prácticas para evitar esta dificultad teórica. Entre las técnicas posibles, se proponen y evalúan varias soluciones, como operaciones de rotación de bits y desplazamiento de bits, que combinadas con la variación dinámica de parámetros y con la perturbación cruzada, proporcionan un excelente remedio al problema de la degradación dinámica. Además de los problemas de seguridad sobre la degradación dinámica, muchos criptosistemas se rompen debido a su diseño descuidado, no a causa de los defectos esenciales de los sistemas caóticos digitales. Este hecho se ha tomado en cuenta en esta tesis y se ha logrado el diseño de generadores pseudoaleatorios caóticos criptogr áficamente seguros.

Caos e fractais na sala de aula

O objectivo deste trabalho é o estudo do tema Caos e Fractais, com o propósito fundamental da sua implementação na sala de aula ou outro ambiente do Ensino Secundário. Com esse fim, é feita uma abordagem teórica dos conteúdos e são apresentadas algumas actividades a desenvolver com os alunos daquele nível de ensino. A introdução dos conceitos é feita de modo a possibilitar a sua leitura por um público mais geral, onde se incluem os alunos mais interessados e curiosos no tema. O estudo é acompanhado, sempre que possível, de exemplos e ilustrações gráficas. Para tal, foi utilizado o software Maxima (software livre) e outras aplicações interactivas disponíveis na Internet. ABSTRACT: The aim of this work is to study the theme of Chaos and Fractals, with the fundamental purpose of its implementation in the classroom, or in other environments of secondary school education. To carry out this aim a theoretical outlook of the contents will be provided alongside some activities to be undergone with students of that school level. The introduction to these concepts is open to the understanding of a larger audience, where we can include the most interested and curious students in this issue. The study is accompanied, whenever possible, with examples and graphics. To do so, the Maxima software (free software) was used, besides other interactive applications available on the Internet.

Quenching across quantum critical points in periodic systems: Dependence of scaling laws on periodicity

We study the quenching dynamics of a many-body system in one dimension described by a Hamiltonian that has spatial periodicity. Specifically, we consider a spin-1/2 chain with equal xx and yy couplings and subject to a periodically varying magnetic field in the (z) over cap direction or, equivalently, a tight-binding model of spinless fermions with a periodic local chemical potential, having period 2q, where q is a positive integer. For a linear quench of the strength of the magnetic field (or chemical potential) at a rate 1/tau across a quantum critical point, we find that the density of defects thereby produced scales as 1/tau(q/(q+1)), deviating from the 1/root tau scaling that is ubiquitous in a range of systems. We analyze this behavior by mapping the low-energy physics of the system to a set of fermionic two-level systems labeled by the lattice momentum k undergoing a nonlinear quench as well as by performing numerical simulations. We also show that if the magnetic field is a superposition of different periods, the power law depends only on the smallest period for very large values of tau, although it may exhibit a crossover at intermediate values of tau. Finally, for the case where a zz coupling is also present in the spin chain, or equivalently, where interactions are present in the fermionic system, we argue that the power associated with the scaling law depends on a combination of q and the interaction strength.

Optimal low-cost transfer to L4 and L5 lagrangian points based on G-family of periodic orbits

An alternative transfer strategy to send spacecrafts to stable orbits around the Lagrangian equilibrium points L4 and L5 based in trajectories derived from the periodic orbits around LI is presented in this work. The trajectories derived, called Trajectories G, are described and studied in terms of the initial generation requirements and their energy variations relative to the Earth through the passage by the lunar sphere of influence. Missions for insertion of spacecrafts in elliptic orbits around L4 and L5 are analysed considering the Restricted Three-Body Problem Earth- Moon-particle and the results are discussed starting from the thrust, time of flight and energy variation relative to the Earth. Copyright© (2012) by the International Astronautical Federation.

Non-periodic quasi-stable nonlinear optical carrier pulses with sliding chirp-free points for transmission at 40 Gbit/s rate

In this paper, we demonstrate the possibility of reaching a quasi-stable nonlinear transmission regime with carrier pulses of 12.5 ps width in multi-channel 40 Gbit/s systems. The quasi-stable pulses that are presented in this work for the first time are not dispersion-managed solitons, and are indeed supported by a large normal span average dispersion and misbalanced optical amplification, and representing a new type of nonlinear carrier.