• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.857-872
• /
• 1994

A PB-chain(Poincare-Birkhoff chain) is by definition a pair of elliptic and hyperbolic n-periodic orbits for a mapping and its existence has been well established numerically or analytically in many particular occasions such as in standard maps or twist maps [1, 8, 9] or Henon maps [1, 2, 12]. This paper gives focus on the investigaton of the appearance of such a PB-chain in a one-parameter family of general area-preserving maps and is in fact a generalization of the results given in [12] for a one-parameter family of specific area-preserving maps, so called Henon maps.

• Journal of Multimedia Information System
• /
• v.2 no.2
• /
• pp.193-206
• /
• 2015

In this paper a new approach for image encryption based on quadruple encryption with dual chaotic maps is proposed. The encryption process is performed with quadruple encryption by invoking the encrypt and decrypt routines with different keys in the sequence EDEE. The decryption process is performed in the reverse direction DDED. The key generation for the quadruple encryption is achieved with a 1D Circle map. The chaotic values for the encrypt and decrypt routines are generated by using a 2D Henon map. The Encrypt routine E is composed of three stages i.e. permutation, pixel value rotation and diffusion. The permutation is achieved by: row and column scrambling with chaotic values, exchanging the lower and the upper principal and secondary diagonal elements based on the chaotic values. The second stage circularly rotates all the pixel values based on the chaotic values. The last stage performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. The security and performance of the proposed scheme are assessed thoroughly by using the key space, statistical, differential, entropy and performance analysis. The proposed scheme is computationally fast with security intact.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.479-485
• /
• 2013

Recently, interest for wireless communication technology with improved security and low eavesdropping probability is increasing rapidly recognizing that information security is an important. Chaos signal can be used encode information efficiently due to irregular phenomena. Chaotic signal is very sensitive to the initial condition. Chaos signal is difficult to detect the signal if you do not know the initial conditions. Also, chaotic signal has robustness to multipath interference. In this paper, we evaluate the performance of correlation delay shift keying (CDSK) modulation with different chaotic map such as Tent map, Logistic map, Henon map, and Bernoulli shift map. Also, we analyze the BER performance depending on the selection of spreading factor (SF) in CDSK. Through the theoretical analyses and simulations, it is confirmed that Henon map has better BER performance than the other three chaotic maps when spreading factor is 70.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.4
• /
• pp.417-425
• /
• 2013

Digital communication technology have been focused on the higher data efficiency and the effective coding of information. Also, it is very important to improve security and minimize the interference of the external sources, Chaos communications system is studied to improve security and minimize the interference by effective encoding of information in the nonlinear systems such as DCSK(Differential Chaos Shift Keying) and CDSK(Correlation Delay Shift Keying). In this paper, we evaluate anti-jamming performance of chaos communications system using the DCSK and CDSK system. The simulation results show that the Gauss iterated map has better BER performance than the other maps(tent map, logistic map, Henon map). Also, DCSK and CDSK system can get the better anti-jamming performance by applying different chaotic maps.

• Journal of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.409-422
• /
• 2003

Let $F: \mathbb{C}^k\;{\rightarrow}\;\mathbb{C}^k$ be a dynamical system and let $\{x_n\}_{n{\geq}0}$ denote an orbit of F. We study the relation between $\{x_n\}$ and pseudoorbits $\{y_n}, y_0=x_0.\;Here\;y_{n+1}=F(y_n)+s_n.$ In general $y_n$ might diverge away from $x_n.$ Our main problem is whether there exists arbitrarily small $t_n$ so that if $\tilde{y}_{n+1}=F(\tilde{y}_n)+s_n+t_n,$ then $\tilde{y}_n$ remains close to $x_n.$ This leads naturally to the concept of sustainable orbits, and their existence seems to be closely related to the concept of hyperbolicity, although they are not in general equivalent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.629-637
• /
• 2013

Chaos communication systems have the characteristics such as non-periodic, wide-band, non-predictability of signals and easy implementation. There have been many studies about chaos communication systems because of these advantages. But, chaos communication systems have low BER(Bit Error Rate) compare to general digital communication system. Existing researches on chaos communication systems only analyze BER performance according to various chaos maps. There are no studies on analysis of BER performance according to PDF(Probability Density Function) of chaos maps. In this paper, we analyze the BER performance according to changing parameter, equation, and initial values of chaos map's PDF. In addition, we propose new chaos map to improve BER performance. Simulation results show that BER performance of CDSK(Correlation Delay Shift Keying) is changed when PDF of chaos map changed. And the proposed chaos map has a better BER performance compare to previous chaos maps such as Tent map, Logistic map, and Henon map.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.29-38
• /
• 2012

Due to the rapid development of network environment and wireless communication technology, the distribution of digital video has made easily and the importance of the protection for digital video has been increased. This paper proposes the digital video encryption system based on multiple chaos maps for MPEG-2 video encoding process. The proposed method generates secret hash key of having 128-bit characteristics from hash chain using Tent map as a basic block and generates $8{\times}8$ lattice cipher by applying this hash key to Logistic map and Henon map. The method can reduce the encryption overhead by doing selective XOR operations between $8{\times}8$ lattice cipher and some coefficient of low frequency in DCT block and it provides simple and randomness characteristic because it uses the architecture of combining chaos maps. Experimental results show that PSNR of the proposed method is less than or equal to 12 dB with respect to encrypted video, the time change ratio, compression ratio of the proposed method are 2%, 0.4%, respectively so that it provides good performance in visual security and can be applied in real time.