A Deterministic Approach to Balancedness and Run Quantification in Pseudorandom Pattern Generators
نویسندگان
چکیده
An easy method of computing the number of 1′s and 0′s (balancedness) as well as the number of runs (run quantification) in the sequence obtained from a LFSR-based pseudorandom patter generator has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. As a straight consequence of the above procedure, simple rules to design pattern generators with adequate pseudorandomness properties are also derived.
منابع مشابه
A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators
A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic operations. The proposed model can serve as a deterministic alternative to existing probabilistic methods for checking balancedness in binary sequence generators. ...
متن کاملPseudorandomness
We postulate that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by any eecient procedure. This yields a robust deenition of pseudorandom generators as eecient deterministic programs stretching short random seeds into longer pseudorandom sequences. Thus, pseudorandom generators can be used to reduce the randomness-complexity in any eecient procedure. Pse...
متن کاملCryptanalysis of Pseudorandom Generators
As a motivating application for the study of lattice in cryptography we consider the construction of pseudorandom generators. We recall that a pseudorandom generator is a program G(x) (computable in deterministic polynomial time) that maps bitstrings x ∈ {0, 1} to longer strings G(x) ∈ {0, 1} such that, if x is chosen uniformly at random and kept secret, then the output G(x) will “look” random ...
متن کاملLecture 22 : Pseudorandomness from Hardness
At the early lectures of this class, it was briefly mentioned that if there exist Pseudorandom Generators for this class, then there exists Pseudorandom Generators for all randomized procedures which run in polynomial time. Because any BPP can be simulated by a Boolean circuit, then there exists Pseudorandom Generators for BBP family. In this class the focus will be in completeness, but the dra...
متن کاملHow to Construct Pseudorandom Permutations from Single Pseudorandom Functions
The paper examines permutation generators which are designed using four rounds of the Data Encryption Standard and a single pseudorandom function. We have proved that such generators are pseudorandom only if the pseudorandom function is used internally at least five times. The proof is given using two different approaches: deterministic and probabilistic. Some cryptographic implications are als...
متن کامل