Statistical complexity measure of pseudorandom bit generators
- 18 April 2005
- journal article
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 354, 281-300
- https://doi.org/10.1016/j.physa.2005.02.054
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Pseudorandom bits generated by chaotic mapsIEEE Transactions on Circuits and Systems I: Regular Papers, 2003
- The period of sequences generated by tent-like mapsIEEE Transactions on Circuits and Systems I: Regular Papers, 2002
- Chaos-based cryptography: a brief overviewIEEE Circuits and Systems Magazine, 2001
- Simple measure for complexityPhysical Review E, 1999
- Cryptography with chaosPhysics Letters A, 1998
- Measures of statistical complexity: Why?Physics Letters A, 1998
- A statistical measure of complexityPhysics Letters A, 1995
- Physical Tests for Random Numbers in SimulationsPhysical Review Letters, 1994
- A computer package for measuring the strength of encryption algorithmsComputers & Security, 1994
- Statistical distance and Hilbert spacePhysical Review D, 1981