IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v356y2005i1p133-138.html
   My bibliography  Save this article

Intensive statistical complexity measure of pseudorandom number generators

Author

Listed:
  • Larrondo, H.A.
  • González, C.M.
  • Martín, M.T.
  • Plastino, A.
  • Rosso, O.A.

Abstract

A Statistical Complexity measure has been recently proposed to quantify the performance of chaotic Pseudorandom number generators (PRNG) (Physica A 354 (2005) 281). Here we revisit this quantifier and introduce two important improvements: (i) consideration of an intensive statistical complexity (Physica A 334 (2004) 119), and (ii) following the prescription of Brand and Pompe (Phys. Rev. Lett. 88 (2002) 174102-1) in evaluating the probability distribution associated with the PRNG. The ensuing new measure is applied to a very well-tested PRNG advanced by Marsaglia.

Suggested Citation

  • Larrondo, H.A. & González, C.M. & Martín, M.T. & Plastino, A. & Rosso, O.A., 2005. "Intensive statistical complexity measure of pseudorandom number generators," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 356(1), pages 133-138.
    • Handle: RePEc:eee:phsmap:v:356:y:2005:i:1:p:133-138
    DOI: 10.1016/j.physa.2005.05.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843710500467X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2005.05.025?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Mengjiao & Liao, Xiaohan & Deng, Yong & Li, Zhijun & Su, Yongxin & Zeng, Yicheng, 2020. "Dynamics, synchronization and circuit implementation of a simple fractional-order chaotic system with hidden attractors," Chaos, Solitons & Fractals, Elsevier, vol. 130(C).
    2. Valle, João & Machicao, Jeaneth & Bruno, Odemir M., 2022. "Chaotical PRNG based on composition of logistic and tent maps using deep-zoom," Chaos, Solitons & Fractals, Elsevier, vol. 161(C).
    3. Pastor, Marissa & Song, Juyong & Hoang, Danh-Tai & Jo, Junghyo, 2016. "Minimal perceptrons for memorizing complex patterns," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 31-37.
    4. Wang, Shaojie & He, Shaobo & Yousefpour, Amin & Jahanshahi, Hadi & Repnik, Robert & Perc, Matjaž, 2020. "Chaos and complexity in a fractional-order financial system with time delays," Chaos, Solitons & Fractals, Elsevier, vol. 131(C).
    5. Lijun Zhang & Caochuan Ma & Yuxiang Zhao & Wenbo Zhao, 2023. "A Novel Dynamic S-Box Generation Scheme Based on Quantum Random Walks Controlled by a Hyper-Chaotic Map," Mathematics, MDPI, vol. 12(1), pages 1-22, December.
    6. Avaroğlu, Erdinç, 2020. "The implementation of ring oscillator based PUF designs in Field Programmable Gate Arrays using of different challenge," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 546(C).
    7. De Micco, Luciana & Fernández, Juana Graciela & Larrondo, Hilda A. & Plastino, Angelo & Rosso, Osvaldo A., 2012. "Sampling period, statistical complexity, and chaotic attractors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2564-2575.
    8. Zunino, L. & Pérez, D.G. & Kowalski, A. & Martín, M.T. & Garavaglia, M. & Plastino, A. & Rosso, O.A., 2008. "Fractional Brownian motion, fractional Gaussian noise, and Tsallis permutation entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6057-6068.
    9. Etem, Taha & Kaya, Turgay, 2020. "A novel True Random Bit Generator design for image encryption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    10. Zunino, Luciano & Zanin, Massimiliano & Tabak, Benjamin M. & Pérez, Darío G. & Rosso, Osvaldo A., 2009. "Forbidden patterns, permutation entropy and stock market inefficiency," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(14), pages 2854-2864.
    11. Eduarda T. C. Chagas & Marcelo Queiroz‐Oliveira & Osvaldo A. Rosso & Heitor S. Ramos & Cristopher G. S. Freitas & Alejandro C. Frery, 2022. "White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane," International Statistical Review, International Statistical Institute, vol. 90(2), pages 374-396, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:356:y:2005:i:1:p:133-138. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.