Application of FPTRNG and Logistic Map in Cryptography

Recently, chaos theory has appeared as the core of many applications in cryptography, information hiding and forensics. One of these chaotic maps is the logistic map. Usually, the secret key (initial condition and control parameter), must be greater than 214 bytes to avoid any cryptographic attack. However, remembering such a long key proves impractical. An ID-based random number generator is used to generate TRNG or PRNG. In this work, I propose an FPTRNG to be used as the secret key for the logistic map. To address the design need, a symmetric logistic-map-based cryptographic system is implemented using confusion and diffusion. The design is tested with image data types. The experiment analyses the following parameters: key space, key sensitivity, sensitivity, autocorrelation, histograms, information entropy, randomness and execution speed. The results show the effectiveness of the proposed technique for secure image data and applicability to multimedia security.