• Marcin Lawnik
  • Arkadiusz Banasik
  • Adrian Kapczyński


Piece-wise linear map, Discrete random variable, Bernoulli distribution.


The values of random variables are commonly used in the field of artificial intelligence. The literature shows plenty of methods, which allows us to generate them, for example, inverse cumulative density function method. Some of the ways are based on chaotic projection. The chaotic methods of generating random variables are concerned with mainly continuous random variables. This article presents the method of generating values from discrete probability distributions with the use of properly constructed piece-wise linear chaotic map. This method is based on a properly constructed discrete dynamical system with chaotic behavior. Successive probability values cover the unit interval and the corresponding random variable values are assigned to the determined subintervals. In the next step, a piece-wise linear map on the subintervals is constructed. In the course of iterations of the chaotic map, consecutive values from a given discrete distribution are derived. The method is presented on the example of Bernoulli distribution. Furthermore, an analysis of the discussed example is conducted and shows that the presented method is the fastest of all analyzed methods.


M. Woźniak, D. Połap, “Hybrid neuro-heuristic methodology for simulation and control of dynamic systems over time interval,” Neural Networks, vol. 93, pp. 45-56, 2017.

R. Brociek, D. Słota, “Application and comparison of intelligent algorithms to solve the fractional heat conduction inverse problem,” Information Technology and Control, vol. 45, issue 2, pp. 184-194, 2016.

I. Gorbenko, A. Kuznetsov, Y. Gorbenko, S. Vdovenko, V. Tymchenko, M. Lutsenko, “Studies on statistical analysis and performance evaluation for some stream ciphers,” International Journal of Computing, vol. 18, issue 1, pp. 82-88, 2019.

W. Stallings, Cryptography and Network Security: Principles and Practice, 6th Edition, Pearson, 2013.

L.E. Bassham, A.L. Rukhin, J. Soto, J.R. Nechvatal, M.E. Smid, E.B. Barker, S.D. Leigh, Mark Levenson, M. Vangel, D.L. Banks, N.A. Heckert, J.F. Dray, S. Vo, SP 800-22 Rev. 1a. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. Technical Report. National Institute of Standards & Technology, Gaithersburg, MD, USA, pp. 1-131, 2010.

R.G. Brown, Dieharder: A Random Number Test Suite, 2020, [Online]. Available at:

G. Marsaglia, W.W. Tsang & J. Wang, “Fast generation of discrete random variables,” Journal of Statistical Software, vol. 11, issue 3, pp. 1-11, 2004.

D. Lai, G. Chen, “Generating different statistical distributions by the chaotic skew tent map,” International Journal of Bifurcation and Chaos, vol. 10, issue 6, pp. 1509-1512, 2000.

M. Lawnik, “Generation of pseudo-random numbers from given probabilistic distribution with the use of chaotic maps,” Proceedings of the 6th International Eurasian Conference on Mathematical Sciences and Applications, IECMSA-2017, Budapest, Hungary, August 15-18, 2017, pp. 1-6.

M. Lawnik, “Generation of pseudo-random numbers with the use of inverse chaotic transformation”, Open Math., vol. 16, issue 1, pp. 16-22, 2018.

A. Luca, A. Ilyas, A. Vlad, “Generating random binary sequences using tent map,” Proceedings of the IEEE International Symposium on Signals, Circuits and Systems (ISSCS 2011), Iasi, Romania, 2011, pp. 81–84.

A. Ilyas, A. Vlad and A. Luca, “Statistical analysis of pseudorandom binary sequences generated by using tent map”, U. P. B. Sci. Bull., vol. 75, pp. 113-122, 2013.

S. Šajić, N. Maletić, B.M. Todorović and M. Šunjevarić, “Random binary sequences in telecommunications,” Journal of Electrical Engineering, vol. 64, issue 4, pp. 230-237, 2013.

V.M. Anikin, S.S. Arkadaksky, S.N. Kuptsov, A.S. Remizov, L.P. Vasilenko, “Lyapunov exponent for chaotic 1D maps with uniform invariant distribution,” Bulletin of the Russian Academy of Sciences: Physics, vol. 72, issue 12, pp.1684-1688, 2008.

A. Lasota, M.C. Mackey, Chaos, Fractals, and Noise: Stochastic Aspects of Dynamics, second ed., Springer, New York, 1993.

M.B. Luca, A. Serbanescu, S. Azou, G. Burel, “A new compression method using a chaotic symbolic approach,” Proceedings of the IEEE-Communications, Bucharest, Romania, 3-5 June 2004, pp. 1-6.

N. Nagaraj, P.G. Vaidya, K.G. Bhat, “Arithmetic coding as a non-linear dynamical system,” Communications in Nonlinear Science and Numerical Simulation, vol. 14, issue 4, pp. 1013-1020, 2009.

A. Pande, P. Mohapatra, J. Zambreno, “Using chaotic maps for encrypting image and video content,” Proceedings of the IEEE Int’l. Symp. Multimedia, pp. 171-78, 2011.

Y. Zhang, D. Xiao, H. Liu, H. Nan, “GLS coding based security solution to JPEG with the structure of aggregated compression and encryption,” Communications in Nonlinear Science and Numerical Simulation, vol. 19, issue 5, pp. 1366-1374, 2014.

K.W. Wong, Q. Lin, J. Chen, “Simultaneous arithmetic coding and encryption using chaotic maps,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 57, issue 2, pp. 146-150, 2010.

Q. Lin, K.W. Wong, J. Chen, “Generalized arithmetic coding using discrete chaotic maps,” International Journal of Bifurcation and Chaos, vol. 22, issue 10, pp. 1250256, 2012.

L. Devroye, Non-Uniform Random Variate Generation, Springer-Verlag New York, 1986.

C. Forbes, E. Merran, N. Hastings, B. Peacock, Statistical Distributions, fourth ed., John Wiley & Sons, New Jersey, 2011.

N. Nagaray, “One-time pad as a nonlinear dynamical system,” Communications in Nonlinear Science and Numerical Simulation, vol. 17, issue 11, pp. 4029-4036, 2012.




How to Cite

Lawnik, M., Banasik, A., & Kapczyński, A. (2020). GENERATION OF VALUES FROM DISCRETE PROBABILITY DISTRIBUTIONS WITH THE USE OF CHAOTIC MAPS. International Journal of Computing, 19(1), 49-54. Retrieved from