Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Chaos
Type of Medium
Language
Year
  • 1
    Language: English
    In: IEEE Transactions on Circuits and Systems-I-Regular Papers, August, 2011, Vol.58(8), p.1897(12)
    Description: This paper presents a compression method that exploits pseudo-chaotic systems, to be applied to True Random Bit Generators (TRBGs). The theoretical explanation of the proposed compression scheme required the projection of some results achieved within the Ergodic Theory for chaotic systems on the world of digital pseudo-chaos. To this aim, a weaker and more general interpretation of the Shadowing Theory has been proposed, focusing on probability measures, rather than on single chaotic trajectories. The design of the compression scheme has been theoretically discussed in order to assure the final entropy of the compressed TRBG to be arbitrarily close to the maximum limit of 1 bit/time-step. The proposed solution requires extremely low-complex hardware circuits for being implemented, assures a constant throughput and is based on theoretical results of general validity.
    Keywords: Cryptography -- Technology Application ; Electric Generators -- Innovations ; Ergodic Theory -- Usage ; Stochastic Processes -- Usage
    ISSN: 1549-8328
    E-ISSN: 15580806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Communications in Nonlinear Science and Numerical Simulation, July 2012, Vol.17(7), pp.2741-2751
    Description: ► We couple an ensemble of existing models representing a single real-world phenomena. ► Models interactively exchange information during learning and prediction. ► Coupling coefficients are learned from short past data of the observed phenomenon. ► Examination with Lorenz systems with radical imperfections show good approximation. ► The ensemble is reduced to be made useful for models of high complexity. Most of the existing approaches for combining models representing a single real-world phenomenon into a multi-model ensemble combine the models a posteriori. Alternatively, in our method the models are coupled into a supermodel and continuously communicate during learning and prediction. The method learns a set of coupling coefficients from short past data in order to unite the different strengths of the models into a better representation of the observed phenomenon. The method is examined using the Lorenz oscillator, which is altered by introducing parameter and structural differences for creating imperfect models. The short past data is obtained by the standard oscillator, and different weight is assigned to each sample of the past data. The coupling coefficients are learned by using a quasi-Newton method and an evolutionary algorithm. We also introduce a way for reducing the supermodel, which is particularly useful for models of high complexity. The results reveal that the proposed supermodel gives a very good representation of the truth even for substantially imperfect models and short past data, which suggests that the super-modeling is promising in modeling real-world phenomena.
    Keywords: Multi-Model Ensembles ; Chaos ; Coupled Oscillators ; Applied Sciences
    ISSN: 1007-5704
    E-ISSN: 1878-7274
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Language: English
    In: IEEE Transactions on Circuits and Systems II: Express Briefs, October 2013, Vol.60(10), pp.702-706
    Description: A method is described for the construction of parameters' subspaces where Markov partitions can be found. The method is illustrated on the three-region piecewise linear 1-D (3PL1D) map, which is a popular approach for the chaos-based random number generator (RNG). For Markov partitions, the 3PL1D chaotic maps behave as Markov sources, and analytical calculation of its information entropy is possible, as demonstrated in this brief. From the knowledge of the stochastic transition matrix of the Markov source, one can exactly measure the appropriateness of the RNG in a given area. For classical RNGs, one typically relies on statistical tests as a quality indicator. Mathematical calculation of the quality of an RNG based on the 3PL1D chaotic maps makes the statistical tests useful only in the postimplementation phase as a verification of the hardware implementation.
    Keywords: Markov Processes ; Entropy ; Chaos ; Generators ; Cryptography ; Polynomials ; Information Entropy ; Chaos ; Information Entropy ; Markov Processes ; Random Number Generation (Rng) ; Engineering
    ISSN: 1549-7747
    E-ISSN: 1558-3791
    Source: IEEE Conference Publications
    Source: IEEE Journals & Magazines 
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: IEEE Transactions on Circuits and Systems-I: Fundamental Theory..., Jan, 2003, Vol.50(1), p.123(4)
    Description: Different possibilities of using chaotic maps as pseudorandom number generators are discussed. A class of chaos-based pseudorandom bit generators is constructed. We give simple arguments to explain the unpredictability of the generators. Index Terms--Chaos, pseudorandom numbers.
    Keywords: Chaos Theory ; Random Numbers ; Chaotic Systems
    ISSN: 1057-7122
    E-ISSN: 15581268
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: IEEE Transactions on Circuits and Systems-I-Regular Papers, June, 2006, Vol.53(6), p.1300(10)
    Description: We propose a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice. For discrete-time dynamical systems, it measures the local (between neighboring points) average spreading of the system. We justify our definition by proving that, for large classes of chaotic maps, the corresponding discrete Lyapunov exponent approaches the largest Lyapunov exponent of a chaotic map when M [right arrow] [infinity], where M is the cardinality of the discrete phase space. In analogy with continuous systems, we say the system has discrete chaos if its discrete Lyapunov exponent tends to a positive number, when M [right arrow] [infinity]. We present several examples to illustrate the concepts being introduced. Index Terms--Chaos, discrete chaos, Lyapunov components.
    Keywords: Chaos Theory -- Analysis ; Liapunov Functions -- Usage ; Discrete Time Systems -- Usage
    ISSN: 1549-8328
    E-ISSN: 15580806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    In: IEEE Transactions on Circuits and Systems-I: Fundamental Theory..., Feb, 2001, Vol.48(2), p.163
    Description: This paper is devoted to the analysis of the impact of chaos-based techniques on block encryption ciphers. We present several chaos based ciphers. Using the well-known principles in the cryptanalysis we show that these ciphers do not behave worse than the standard ones, opening in this way a novel approach to the design of block encryption ciphers. Index Terms--Block encryption ciphers, chaos, cryptography, S-boxes.
    Keywords: Data Encryption -- Research ; Cryptography -- Research
    ISSN: 1057-7122
    E-ISSN: 15581268
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    In: IEEE Transactions on Circuits and Systems-I: Fundamental Theory..., March, 2001, Vol.48(3), p.281
    Description: This paper and its companion (Part II) are devoted to the analysis of the application of a chaotic piecewise-linear one-dimensional(PL1D) map as random number generator (RNG). Piecewise linearity of the map enables us to mathematically find parameter values for which a generating partition is Markov and the RNG behaves as a Markov information source, and then to mathematically analyze the information generation process and the RNG. In the companion paper we discuss practical aspects of our chaos-based RNGs. Index Terms--Chaos, random number generator, symbolic dynamics.
    Keywords: Random Number Generators (Software) -- Models ; Chaotic Systems -- Usage ; Markov Processes -- Analysis
    ISSN: 1057-7122
    E-ISSN: 15580806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: IEEE Transactions on Information Theory, April, 2006, Vol.52(4), p.1366(19)
    Description: 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 signal-to-noise ratio (SNR). Using this approach, we show that virtually all the iterative decoding schemes in use today exhibit similar qualitative dynamics. In particular, a whole range of phenomena known to occur in nonlinear systems, such as existence of multiple fixed points, oscillatory behavior, bifurcations, chaos, and transient chaos are found in iterative decoding algorithms. As an application, we develop an adaptive technique to control transient chaos in the turbo-decoding algorithm, leading to a substantial improvement in performance. We also propose a new stopping criterion for turbo codes that achieves the same performance with considerably fewer iterations. Index Terms--Bifurcation theory, chaos, dynamical systems, iterative decoding, low-density parity-check codes, product codes, turbo codes.
    Keywords: Chaos Theory -- Analysis ; Bifurcation Theory -- Analysis ; Entropy (Information theory) -- Analysis
    ISSN: 0018-9448
    E-ISSN: 15579654
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    In: IEEE Transactions on Circuits and Systems-I: Fundamental Theory..., March, 2001, Vol.48(3), p.382
    Description: 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 redundancy and maximum margin against parasitic attractors. Further, the map is implemented in a 0.8 [micro]]m standard CMOS process utilizing switched current techniques. Post-layout circuit simulations of the RNG indicate no periodic attractors over variations in temperature, power supply and process conditions, and maximum redundancy of 0.4%. We estimate that the output bit rate of our RNG is 1 Mbit/s, which is substantially higher than the output bit rate of RNGs available on the market. Index Terms--Chaos, CMOS, random number generator.
    Keywords: Random Number Generators (Software) -- Models ; Complementary Metal Oxide Semiconductors -- Usage ; Chaotic Systems -- Usage
    ISSN: 1057-7122
    E-ISSN: 15581268
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Language: English
    In: IEEE Transactions on Circuits and Systems-II-Express Briefs, Oct, 2007, Vol.54(10), p.882(5)
    Description: In a recent paper, Jakimoski and Subbalakshmi provided a nice connection between the so-called discrete Lyapunov exponent of a permutation F defined on a finite lattice and its maximal differential probability, a parameter that measures the complexity of a differential cryptanalysis attack on the substitution defined by F. In this brief, we take a second look at their result to find some practical shortcomings. We also discuss more general aspects. Index Terms--Differential cryptanalysis, discrete Lyapunov exponent (DLE), maximum differential probability (DP).
    Keywords: Liapunov Functions -- Evaluation ; Probability Theory -- Research ; Cryptography -- Research
    ISSN: 1549-7747
    E-ISSN: 15583791
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages