The NIST codebook-based deterministic random bit generators are analyzed in the context of being indistinguishable from random. Upper and lower bounds based on the probability of distinguishing the output are proven. These bounds imply that the security of the designs are bounded by the codebook width, or more precisely on the property that the codebooks act like a random permutation, as oppose...

Chaotic cryptology is widely investigated recently. This paper reviews the progress in this area and points out some existent problems in digital chaotic ciphers. As a comprehensive solution to these problems, a novel pseudo-random bit generator based on a couple of chaotic systems called CCS-PRBG is presented. Detailed theoretical analyses show that it has perfect cryptographic properties, and...

As we realize that, progression in innovation needs the progressions in security. The development of RFID innovation expands step by step. To give security to the RFID framework, new approach or new thoughts we require in the field of security. The fundamental thought of my examination is to coordinate RFID and Sensor innovation to assemble a keen RFID security framework. Two situations of mix ...

In the literature, little attention is paid to devising and analyzing novel one dimensional chaotic mappings. our previous efforts, we have tried fold, translation & scale on arctangent function sigmoid respectively, which brings good results. this paper, do same obtain a variant of Hyperbolic Cosine Function. Both Bifurcation Diagram Lyapunov Exponent Spectrum manifest that new mapping pos...

Abstract The polar code is a unique coding approach that can achieve Shannon's capacity in modern communication systems' discrete memory-less channels with superior reliability, but it not secure enough under attacks for such systems. This study aims to offer comprehensive secured scheme uses combination of and the Mersenne-Twister pseudo-random number generator (MT-PRNG) super encoding. pre-sh...

In this work, Pseudo-Random Bit Generation (PRBG) based on 2D chaotic mappings of logistic type is considered. The sequences generated with two Pseudorandom Bit Generators (PRBGs) of this type are statistically tested and the computational effectiveness of the generators is estimated. The role played by the symmetry and the geometrical properties of the underlying chaotic attractors is also exp...