Linear Feedback Shift Registers Essay -- Computers, Cryptography

Abstract Linear Feedback Shift Registers (LFSRs) are considered powerful methods for generating pseudo- haphazard bits in cryptograph algorithm applications. In this paper it is shown that the linear dependencies in the provided random bit episodes can be controlled by adding a chaotic logistic map to the LFSRs bodys. The structure of the LFSRs output sequence in combination with a chaotic map is analyzed and proved to score at least as much uniformity than the corresponding identify for the linear components individually. In order to understand that using the proposed PRBG is true(p) in secure algorithms, the NIST entourage test have been taken on the proposed method, at long last to compare the proposed PRNG output sequence features with the two types of LFSRs (Fibonacci and Galois).Keywords Linear Feedback Shift Register, ergodic Number, Chaotic Map, NIST. 1. IntroductionIn the modern world of computers, network earnest is the main concern which relies on the use of cr yptography algorithms. high type random number generation is a basic subject of cryptography algorithms and the importance of a secure random number generator excogitation cannot be underestimated. Most common generation techniques about RNGs involve unfeignedly random and pseudorandom number generators. For a brief introduction in various types of RNGs Truly Random Number Generators (RNGs) is a computer algorithm, which generates a sequence of statistically independent random numbers. Actually these generators require a course occurring source of randomness phenomena (i.e. as a non-deterministic system). Most practical implementations end a hardware device or a software course of study based on RNGs to produce a bit sequence which is statistically independent.Pseud... ...3245, 0.9966745 so the p-values of our purposed method is in this interval and then the 15 tests of the NIST suite have been passed as shown In Fig. 6.Fig. 6. NIST test result (Red is the Proposed PRNG, Blu e represents Galois and greenness is Fibonacci)6. ConclusionIn this paper we presented a novel method to generate random bit sequence by combination of LFSRs system and chaotic logistic map and it has been proved in a reliable theorem. At the end, we compared it with the same other methods such as Fibonacci LFSR and Galois LFSR, and the result was shown in table 1. AcknowledgmentsThe author wish to thank the editor Professor G.Najafpour, Dr. H.Hassanpour and my teacher Mr. H.Rahimov for their valuable comments. In the end should be appreciated the efforts of Shahrood University of Technologys ITC research center.