The intriguing characteristics of chaotic maps have prompted researchers to use these sequences in watermarking systems to good effect. In this paper we aim to use a tent map to encrypt the binary logo to achieve a like-noise signal. This approach makes extraction of the watermark signal by potential attacker very hard. Embedding locations are selected based on certain principles. Experimental ...

Pseudo random numbers are used for several proposes where uniformity data is desired. For generating them, there are some useful methods, feedback shift registers and dynamical functions are most common methods. Among dynamical functions, onedimensional chaotic maps are the simplest ones. The tent map is a piecewise-linear onedimensional map that has been used to generate pseudo random numbers....

Feature selection is a crucial process in machine learning and data mining that identifies the most pertinent valuable features dataset. It enhances efficacy precision of predictive models by efficiently reducing number features. This reduction improves classification accuracy, lessens computational burden, overall performance. study proposes improved binary golden jackal optimization (IBGJO) a...

This paper proposes a novel ultrasonic ranging method using discrete chaotic phase modulated (CPM) signal. As the driving signal of the ultrasonic transducer, the CPM signal shows the property of sharp autocorrelation and flat cross-correlation, even when its length is kept short, which is very important to improving efficiency. The proposed method can provide high-precision measurement and is ...

This article is dedicated to exploring the possibility of using simplest principles nonlinear discrete dynamic systems theory in computer cryptography, which are characterized by their chaotic behavior. The main problem calculations that number possible states a finite. Therefore, models chaos only an approximation true behavior, and each trajectory approximated system periodic. From mathematic...

The invariant Cantor sets of the logistic map gμ(x) = μx(1 − x) for μ > 4 are hyperbolic and form a continuous family. We show that this family can be obtained explicitly through solutions of infinitely coupled differential equations due to the hyperbolicity. The same result also applies to the tent map Ta(x) = a(1/2− |1/2− x|) for a > 2.

The paper presents a detailed analysis of two types of pseudorandom binary sequence generators obtained by using tent map. The test is performed using a NIST statistical test suite which is widely used for testing the randomness of any random number generator. The binary sequences under investigation are obtained either by considering all the successive iterations of the tent map and choosing a...

In this study, with an FPGA-board using VHDL, we designed a secure chaos-based stream cipher (SCbSC), and evaluated its hardware implementation performance in terms of computational complexity security. The fundamental element the system is proposed pseudo-chaotic number generator (SPCNG). architecture SPCNG includes three first-order recursive filters, each containing discrete chaotic map mixi...

This paper presents the definition of k-error approximate entropy and proves its two basic properties, which measures the stability of chaotic pseudorandom sequences. Then the stabilities of Logistic, Hénon, Tent and Chebyshev maps are evaluated. Simulation results indicate that the approach is effective, which can distinguish the difference of stability of diverse chaotic sequences, and is an ...

In this paper, by using Logistic, Sine and Tent systems we define a combination chaotic system. Some properties of the chaotic system are studied by using figures and numerical results. A color image encryption algorithm is introduced based on new chaotic system. Also this encryption algorithm can be used for gray scale or binary images. The experimental results of the encryption algorithm show...