Analysis and design of stream ciphers
Analysis and design of stream ciphers
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Digital logic circuit analysis and design
Digital logic circuit analysis and design
Logic and discrete mathematics: a computer science perspective
Logic and discrete mathematics: a computer science perspective
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
Analysis and Synthesis of Logic Systems
Analysis and Synthesis of Logic Systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Shift Register Sequences
On the Linear Complexity of the Power Generator
Designs, Codes and Cryptography
On the balancedness of nonlinear generators of binary sequences
Information Processing Letters
Large families of sequences with near-optimal correlations and large linear span
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.