SearcharxivSearch

arXiv subjects

F. Montoya

Publications and source records attributed to F. Montoya.

14 recordsLinked to original sources

3-body harmonic molecule

In this study, the quantum 3-body harmonic system with finite rest length $R$ and zero total angular momentum $L=0$ is explored. It governs the near-equilibrium $S$-states eigenfunctions $\psi(r_{12},r_{13},r_{23})$ of three identical point particles interacting by means of any pairwise confining potential $V(r_{12},r_{13},r_{23})$ that entirely depends on the relative distances $r_{ij}=|{\mathbf r}_i-{\mathbf r}_j|$ between particles. At $R=0$, the system admits a complete separation of variables in Jacobi-coordinates, it is (maximally) superintegrable and exactly-solvable. The whole spectra of excited states is degenerate, and to analyze it a detailed comparison between two relevant Lie-algebraic representations of the corresponding reduced Hamiltonian is carried out. At $R>0$, the problem is not even integrable nor exactly-solvable and the degeneration is partially removed. In this case, no exact solutions of the Schr\"odinger equation have been found so far whilst its classical counterpart turns out to be a chaotic system. For $R>0$, accurate values for the total energy $E$ of the lowest quantum states are obtained using the Lagrange-mesh method. Concrete explicit results with not less than eleven significant digits for the states $N=0,1,2,3$ are presented in the range $0\leq R \leq 4.0$~a.u. . In particular, it is shown that (I) the energy curve $E=E(R)$ develops a global minimum as a function of the rest length $R$, and it tends asymptotically to a finite value at large $R$, and (II) the degenerate states split into sub-levels. For the ground state, perturbative (small-$R$) and two-parametric variational results (arbitrary $R$) are displayed as well. An extension of the model with applications in molecular physics is briefly discussed.

quant-ph

Breaking Points in Quartic Maps

Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some phenomena can depend alternatively of two values of the same parameter. We use the quadratic map $x_{n+1} =1-ax_{n}^{2} $ when the parameter alternates between two values during the iteration process. In this case, the orbit of the alternate system is the sum of the orbits of two quartic maps. The bifurcation diagrams of these maps present breaking points where abruptly change their evolution.

nlin.CD

Finding Attractors of Continuous-Time Systems by Parameter Switching

The review presents a parameter switching algorithm and his applications which allows numerical approximation of any attractor of a class of continuous-time dynamical systems depending linearly on a real parameter. The considered classes of systems are modeled by a general initial value problem embedding dynamical systems which are continuous and discontinuous with respect to the state variable, and of integer and fractional order. The numerous results, presented in several papers, are systematized here on four representative known examples representing the four classes. The analytical proof of the algorithm convergence for the systems belonging to the continuous class is briefly presented, while for the other categories of systems the convergence is numerically verified via computational tools. The utilized numerical tools necessary to apply the algorithm are contained in five appendices.

nlin.CD

Trident, a new pseudo random number generator based on coupled chaotic maps

This article describes a new family of cryptographically secure pseudorandom number generators, based on coupled chaotic maps, that will serve as keystream in a stream cipher. The maps are a modification of a piecewise linear map, by dynamic changing of the coefficient values and perturbing its lesser significant bits.

cs.CR

Lorenz System Parameter Determination and Application to Break the Security of Two-channel Chaotic Cryptosystems

This paper describes how to determine the parameter values of the chaotic Lorenz system used in a two-channel cryptosystem. The geometrical properties of the Lorenz system are used firstly to reduce the parameter search space, then the parameters are exactly determined, directly from the ciphertext, through the minimization of the average jamming noise power created by the encryption process.

nlin.CD

Security problems with a SC-CNN-based Chaotic Masking Secure Communication System

This paper studies the security of a chaotic cryptosystem based on the Chua circuit and implemented with State Controlled Cellular Neural Networks. It is shown that the plaintext can be retrieved by ciphertext band-pass filtering after an imperfect decoding with wrong receiver parameters. It is also shown that the key space of the system can be notably reduced easing a brute force attack. The system parameters were determined with high precision through the analysis of the decoding error produced by the mismatch between receiver and transmitter parameters.

nlin.CD

A New Lorenz System Parameter Determination Method and Applications

This paper describes how to determine the parameter values of the chaotic Lorenz system from one of its variables waveform. The geometrical properties of the system are used firstly to reduce the parameter search space. Then, a synchronization-based approach, with the help of the same geometrical properties as coincidence criteria, is implemented to determine the parameter values with the wanted accuracy. The method is not affected by a moderate amount of noise in the waveform. As way of example of its effectiveness, the method is applied to figure out directly from the ciphertext the secret keys of two-channel chaotic cryptosystems using the variable $z$ as a synchronization signal, based on the ultimate state projective chaos synchronization.

nlin.CD

Security analysis of communication system based on the synchronization of different order chaotic systems

This work analyzes the security weakness of a recently proposed communication method based on chaotic modulation and masking using synchronization of two chaotic systems with different orders. It is shown that its application to secure communication is unsafe, because it can be broken in two different ways, by high-pass filtering and by reduced order system synchronization, without knowing neither the system parameter values nor the system key.

nlin.CD

Cryptanalyzing an improved security modulated chaotic encryption scheme using ciphertext absolute value

This paper describes the security weakness of a recently proposed improved chaotic encryption method based on the modulation of a signal generated by a chaotic system with an appropriately chosen scalar signal. The aim of the improvement is to avoid the breaking of chaotic encryption schemes by means of the return map attack introduced by Perez and Cerdeira. A method of attack based on taking the absolute value of the ciphertext is presented, that allows for the cancellation of the modulation scalar signal and the determination of some system parameters that play the role of system key. The proposed improved method is shown to be compromised without any knowledge of the chaotic system parameter values and even without knowing the transmitter structure.

nlin.CD

Breaking parameter modulated chaotic secure communication system

This paper describes the security weakness of a recently proposed secure communication method based on parameter modulation of a chaotic system and adaptive observer-based synchronization scheme. We show that the security is compromised even without precise knowledge of the chaotic system used.

nlin.CD

Cryptanalysis of dynamic look-up table based chaotic cryptosystems

In recent years many chaotic cryptosystems based on Baptista's seminal work have been proposed. We analyze the security of two of the newest and most interesting ones, which use a dynamically updated look-up table and also work as stream ciphers. We provide different attack techniques to recover the keystream used by the algorithms. The knowledge of this keystream provides the attacker with the same information as the key and thus the security is broken. We also show that the dependence on the plaintext, and not on the key, of the look-up table updating mechanism facilitates cryptanalysis.

nlin.CD