By Topic

Chaos-based random number generators-part I: analysis [cryptography]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Stojanovski, T. ; Expert Inf. Services, Melbourne, Vic., Australia ; Kocarev, L.

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

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:48 ,  Issue: 3 )