Design and Implementation of a Chaotic-Time-Varying Distribution PRNG

Authors

  • Raúl Eduardo Lopresti
  • Maximiliano Antonelli
  • Julio Dondo
  • Luciana De Micco

DOI:

https://doi.org/10.37537/rev.elektron.6.1.156.2022

Keywords:

Pseudorandom number generator, Probability Density Function, Dynamic Partial Reconfiguration, Chaos

Abstract

Many electronic applications require pseudo-random numbers, in general, to improve their performance. Such is the case of encryption, coding and digital modulation systems. In addition, it is possible to enhance the effect if the pseudorandom numbers dynamically vary their probability density function (PDF). In this article, a circuit that generates pseudo-random numbers that are capable of varying their PDF in time is presented. To this aim, chaotic maps are used as a base, which are designed according to the desired PDF. Then, the implementation is done through Dynamic Partial Reconfiguration (RPD) which allows modifying, at run time, part of the circuit to vary the PDF of the generated output.

Downloads

Download data is not yet available.

References

L. De Micco, D. Petruzzi, H. A. Larrondo, and J. C. C. Moreira, “Randomness of finite-state sequence machine over gf (4) and quality of hopping turbo codes,” IET Communications, vol. 7, no. 9, pp. 783–790, 2013.

K. Abd El-Latif, H. Hamed, and E. Hasaneen, “Fpga implementation of the pipelined data encryption standard (des) based on variable time data permutation,” the online journal on electrics and electrical engineering (OJEEE), vol. 2, no. 3, pp. 298–302, 2010.

P. Cao, X. Hu, J. Wu, L. Zhang, X. Jiang, and Y. Su, “Physical layer encryption in ofdm-pon employing time-variable keys from onus,” IEEE Photonics Journal, vol. 6, no. 2, pp. 1–6, 2014.

S. Oukili and S. Bri, “High throughput fpga implementation of data encryption standard with time variable sub-keys,” International Journal of Electrical and Computer Engineering, vol. 6, no. 1, p. 298, 2016.

S. L. Davis, “Enhancing system security using dynamic hardware,” Ph.D. dissertation, University of South Alabama, 2022. [6] R. C. Cheng, “Random variate generation,” Handbook of Simulation, pp. 139–172, 1998.

D. Pingel, P. Schmelcher, and F. Diakonos, “Theory and examples of the inverse frobenius–perron problem for complete chaotic maps,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 9, no. 2, pp. 357–366, 1999.

N. Wei, “Solutions of the inverse frobenius-perron problem,” Ph.D. dissertation, Concordia University, 2015.

C. Fox, L.-J. Hsiao, and J.-E. K. Lee, “Solutions of the multivariate inverse frobenius–perron problem,” Entropy, vol. 23, no. 7, p. 838, 2021.

A. Rogers, R. Shorten, and D. M. Heffernan, “Synthesizing chaotic maps with prescribed invariant densities,” Physics Letters A, vol. 330, no. 6, pp. 435–441, 2004.

L. De Micco and H. Á. Larrondo, “Síntesis e implementación en fpga de un mapa caótico con pdf gaussiana,” in II Congreso de Microelectrónica Aplicada (µEA 2011)(La Plata, 7 al 9 de septiembre de 2011), 2011.

L. De Micco, M. Antonelli, and H. A. Larrondo, “Stochastic degradation of the fixed-point version of 2d-chaotic maps,” Chaos, Solitons & Fractals, vol. 104, pp. 477–484, 2017.

J. Lin, “Divergence measures based on the shannon entropy,” IEEE Transactions on Information theory, vol. 37, no. 1, pp. 145–151, 1991.

Analog Devices, ADFMCOMMS4-EBZ. [Online]. Available: https://www.analog.com/en/design-center/evaluation-hardware-and-software/evaluation-boards-kits/eval-ad-fmcomms4-ebz.html

Published

2022-06-15

Issue

Section

Computer Networks and Informatics

How to Cite

[1]
R. E. Lopresti, M. Antonelli, J. Dondo, and L. De Micco, “Design and Implementation of a Chaotic-Time-Varying Distribution PRNG”, Elektron, vol. 6, no. 1, pp. 46–51, Jun. 2022, doi: 10.37537/rev.elektron.6.1.156.2022.