- Full text PDF available (74)
- This year (4)
- Last 5 years (31)
- Last 10 years (66)
Data Set Used
Necessary and sufficient conditions for the occurrence of generalized synchronization of unidirec-tionally coupled dynamical systems are given in terms of asymptotic stability. The relation between generalized synchronization, predictability, and equivalence of dynamical systems is discussed. All theoretical results are illustrated by analytical and… (More)
—In this brief article, chaos-based cryptography is discussed from a point of view which I believe is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers. I hope that, although this paper raises more questions than provides answers, it nevertheless contains seeds for future work.
—Digital chaotic ciphers have been investigated for more than a decade. However, their overall performance in terms of the tradeoff between security and speed, as well as the connection between chaos and cryptography, has not been sufficiently addressed. We propose a chaotic Feistel cipher and a chaotic uniform cipher. Our plan is to examine crypto… (More)
We discuss the relationship between cryptography and chaos theory, and similarities of their crucial concepts such as mixing property and sensitivity to changes in initial conditions and parameters. A systematic procedure for design of encryption algorithms based on chaotic maps is suggested. We present an example based on logistic map.
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed , they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such… (More)
—This paper and its companion (Part I) are devoted to to the analysis of the application of a chaotic piecewise-linear one-dimensional (PL1D) map as Random Number Generator (RNG). In Part I, we have mathematically analyzed the information generation process of a class of PL1D maps. In this paper, we find optimum parameters that give an RNG with lowest… (More)
Iterative decoding algorithms may be viewed as high-dimensional nonlinear dynamical systems, depending on a large number of parameters. In this work, we introduce a simplified description of several iterative decoding algorithms in terms of the a posteriori average entropy, and study them as a function of a single parameter that closely approximates the… (More)
—We introduce a method for generating a sequence of semi-random interleavers, intended to be optimally stored and employed in a turbo coding system that requires flexibility of the input block (i.e., interleaver) size. A distinctive feature of this method is seen in the very simple rules for obtaining shorter/longer inter-leavers by pruning/adding positions… (More)