Pseudo-Random Bit Generation based on 2D chaotic maps of logistic type and its Applications in Chaotic Cryptography
Preprint
Abstract
Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type is considered. The sequences generated with a chaotic PRBG of this type, are statistically tested and the computational effectiveness of the generators is estimated. Considering this PRBG valid for cryptography, the size of the available key space is also calculated. Different cryptographic applications can be suitable to this PRBG, being a stream cipher probably the most immediate of them.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMSInternational Journal of Bifurcation and Chaos, 2006
- ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPSInternational Journal of Bifurcation and Chaos, 2005
- COMPLEX PATTERNS ON THE PLANE: DIFFERENT TYPES OF BASIN FRACTALIZATION IN A TWO-DIMENSIONAL MAPPINGInternational Journal of Bifurcation and Chaos, 2003
- Chaos-based cryptography: a brief overviewIEEE Circuits and Systems Magazine, 2001
- Dynamics of maps with a global multiplicative couplingChaos, Solitons & Fractals, 1991