• Title/Summary/Keyword: Chaotic map

Search Result 114, Processing Time 0.02 seconds

Detecting Chaotic Motions of a Piecewise-Linear System in the Noisy Fields by Mean Poincare Maps (평균 포인케어맵을 이용한 Noisy Field에서의 chaos거동의 검출방법)

  • 마호성
    • Computational Structural Engineering
    • /
    • v.10 no.4
    • /
    • pp.239-249
    • /
    • 1997
  • The method to distinguish chaotic attractors in the perturbed response behaviors of a piecewise-linear system under combined regular and external randomness is provided and examined. In the noisy fields such as the ocean environment, excitation forces induced by wind, waves and currents contain a finite degree of randomness. Under external random perturbations, the system responses are disturbed, and consequently chaotic signatures in the response attractors are not distinguishable, but rather look just random-like. Mean Poincare map can be utilized to identify such chaotic responses veiled due to the random noise by averaging the noise effect out of the perturbed responses. In this study, the procedure to create mean Poincare map combined with the direct numerical simulations is provided and examined. It is found that mean Poincare maps can successfully distinguish chaotic attractors under stochastic excitations, and also can give the information of limit value of noise intensity with which the chaos signature in system responses vanishes.

  • PDF

Chaotic response of a double pendulum subjected to follower force (종동력을 받는 진동계의 케이오틱 거동 연구)

  • 이재영;장안배
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1996.10a
    • /
    • pp.295-300
    • /
    • 1996
  • In this study, the dynamic instabilities of a nonlinear elastic system subjected to follower force are investigated. The two-degree-of-freedom double pendulum model with nonlinear geometry, cubic spring, and linear viscous damping is used for the study. The constant and periodic follower forces are considered. The chaotic nature of the system is identified using the standard methods, such as time histories, phase portraits, and Poincare maps, etc.. The responses are chaotic and unpredictable due to the sensitivity to initial conditions. The sensitivities to parameters, such as geometric initial imperfections, magnitude of follower force, and viscous damping, etc. is analysed. The strange attractors in Poincare map have the self-similar fractal geometry. Dynamic buckling loads are computed for various parameters, where the loads are changed drastically for the small change of parameters.

  • PDF

ALMOST PERIODIC HOMEOMORPHISMS AND CHAOTIC HOMEOMORPHISMS

  • Lee, Joo Sung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.4
    • /
    • pp.477-484
    • /
    • 2007
  • Let h : M ${\rightarrow}$ M be an almost periodic homeomorphism of a compact metric space M onto itself. We prove that h is topologically transitive iff every element of M has a dense orbit. It follows as a corollary that an almost periodic homeomorphism of a compact metric space onto itself can not be chaotic. Some additional related observations on a Cantor set are made.

  • PDF

Design of RFID Authentication Protocol Using 2D Tent-map (2차원 Tent-map을 이용한 RFID 인증 프로토콜 설계)

  • Yim, Geo-su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.425-431
    • /
    • 2020
  • Recent advancements in industries and technologies have resulted in an increase in the volume of transportation, management, and distribution of logistics. Radio-frequency identification (RFID) technologies have been developed to efficiently manage such a large amount of logistics information. The use of RFID for management is being applied not only to the logistics industry, but also to the power transmission and energy management field. However, due to the limitation of program development capacity, the RFID device is limited in development, and this limitation is vulnerable to security because the existing strong encryption method cannot be used. For this reason, we designed a chaotic system for security with simple operations that are easy to apply to such a restricted environment of RFID. The designed system is a two-dimensional tent map chaotic system. In order to solve the problem of a biased distribution of signals according to the parameters of the chaotic dynamical system, the system has a cryptographic parameter(𝜇1), a distribution parameter(𝜇2), and a parameter(𝜃), which is the constant point, ID value, that can be used as a key value. The designed RFID authentication system is similar to random numbers, and it has the characteristics of chaotic signals that can be reproduced with initial values. It can also solve the problem of a biased distribution of parameters, so it is deemed to be more effective than the existing encryption method using the chaotic system.

Image Encryption by C-MLCA and 3-dimensional Chaotic Cat Map using Laplace Expansions (C-MLCA와 Laplace 전개를 이용한 3차원 카오스 캣맵에 의한 영상 암호)

  • Cho, Sung-Jin;Kim, Han-Doo;Choi, Un-Sook;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.6
    • /
    • pp.1187-1196
    • /
    • 2019
  • Information security has become a major challenge with the advent of cloud and social networking sites. Conventional encryption algorithms might not be suitable for image encryption because of the large data size and high redundancy among the raw pixels of a digital image. In this paper, we generalize the encryption method for of color image proposed by Jeong et al. to color image encryption using parametric 3-dimensional chaotic cat map using Laplace expansion and C-MLCA. Through rigorous experiments, we demonstrate that the proposed new image encryption system provides high security and reliability.

An efficient and anonymous Chaotic Map based authenticated key agreement for multi-server architecture

  • Irshad, Azeem;Ahmad, Hafiz Farooq;Alzahrani, Bander A.;Sher, Muhammad;Chaudhry, Shehzad Ashraf
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5572-5595
    • /
    • 2016
  • Multi-server authentication enables the subscribers to enjoy an assortment of services from various service providers based on a single registration from any registration centre. Previously, a subscriber had to register from each service provider individually to avail respective services relying on single server authentication. In the past, a number of multi-server authentication techniques can be witnessed that employed lightweight and even computationally intensive cryptographic operations. In line with this, Zhu has presented a chaotic map based multi-server authentication scheme recently, which is not only vulnerable to denial-of-service attack, stolen-verifier attack, but also lacks anonymity. This research aims at improving the Zhu's protocol in terms of cost and efficiency. Moreover, the comparative study is presented for the performance of improved model against the existing scheme, and the security of proposed model is formally proved using BAN Logic.

Highly dispersive substitution box (S-box) design using chaos

  • Faheem, Zaid Bin;Ali, Asim;Khan, Muhamad Asif;Ul-Haq, Muhammad Ehatisham;Ahmad, Waqar
    • ETRI Journal
    • /
    • v.42 no.4
    • /
    • pp.619-632
    • /
    • 2020
  • Highly dispersive S-boxes are desirable in cryptosystems as nonlinear confusion sublayers for resisting modern attacks. For a near optimal cryptosystem resistant to modern cryptanalysis, a highly nonlinear and low differential probability (DP) value is required. We propose a method based on a piecewise linear chaotic map (PWLCM) with optimization conditions. Thus, the linear propagation of information in a cryptosystem appearing as a high DP during differential cryptanalysis of an S-box is minimized. While mapping from the chaotic trajectory to integer domain, a randomness test is performed that justifies the nonlinear behavior of the highly dispersive and nonlinear chaotic S-box. The proposed scheme is vetted using well-established cryptographic performance criteria. The proposed S-box meets the cryptographic performance criteria and further minimizes the differential propagation justified by the low DP value. The suitability of the proposed S-box is also tested using an image encryption algorithm. Results show that the proposed S-box as a confusion component entails a high level of security and improves resistance against all known attacks.

An Optimized PI Controller Design for Three Phase PFC Converters Based on Multi-Objective Chaotic Particle Swarm Optimization

  • Guo, Xin;Ren, Hai-Peng;Liu, Ding
    • Journal of Power Electronics
    • /
    • v.16 no.2
    • /
    • pp.610-620
    • /
    • 2016
  • The compound active clamp zero voltage soft switching (CACZVS) three-phase power factor correction (PFC) converter has many advantages, such as high efficiency, high power factor, bi-directional energy flow, and soft switching of all the switches. Triple closed-loop PI controllers are used for the three-phase power factor correction converter. The control objectives of the converter include a fast transient response, high accuracy, and unity power factor. There are six parameters of the controllers that need to be tuned in order to obtain multi-objective optimization. However, six of the parameters are mutually dependent for the objectives. This is beyond the scope of the traditional experience based PI parameters tuning method. In this paper, an improved chaotic particle swarm optimization (CPSO) method has been proposed to optimize the controller parameters. In the proposed method, multi-dimensional chaotic sequences generated by spatiotemporal chaos map are used as initial particles to get a better initial distribution and to avoid local minimums. Pareto optimal solutions are also used to avoid the weight selection difficulty of the multi-objectives. Simulation and experiment results show the effectiveness and superiority of the proposed method.

128-Bit Chaotic Block Encryption Scheme Using a PLCM (PLCM을 이용한 128비트 카오스 블록 암호화 기법)

  • Lee, Sung-Woo;Lee, Min-Goo;Park, Jeong-Yeol;Shin, Jae-Ho
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.4 no.2
    • /
    • pp.19-27
    • /
    • 2005
  • In this paper, we propose 128-bit chaotic block encryption scheme using a PLCM (Piecewise Linear Chaotic Map) having a good dynamical property. The proposed scheme has a block size of 128- bit and a key size of 128-bit. The encrypted code is generated from the output of PLCM. We show the proposed scheme is very secure against statistical attacks and have very good avalanche effect and randomness properties.

  • PDF