Pseudo-Random Bit Generation based on 2D chaotic maps of logistic type and its Applications in Chaotic Cryptography

TL;DR

This paper introduces a pseudo-random bit generator based on 2D logistic chaotic maps, evaluates its statistical and cryptographic suitability, and discusses its potential applications in secure communications.

Contribution

It presents a novel chaotic PRBG using 2D logistic maps, analyzes its statistical properties, and assesses its cryptographic key space and practical applications.

Findings

Sequences pass statistical randomness tests

Generator has a large key space suitable for cryptography

Potential use in stream cipher applications

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.