Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences
A method of computing the number of 1′ s and 0′ s as well as the number of runs of any length in the sequence obtained from a LFSR-based generator has been developed. The procedure that is based on the decomposition of the generating function in global minterms allows one to check balancedness and run distribution goodness in the output sequence. Simple design rules are also derived.
KeywordsBalancedness run distribution minterm stream cipher cryptography
Unable to display preview. Download preview PDF.
- 1.Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)Google Scholar
- 8.Meier, W., Staffelbach, O.: Nonlinearity Criteria for Cryptographic Functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–563. Springer, Heidelberg (1990)Google Scholar
- 12.Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, New York (1991)Google Scholar