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.
KeywordsDeterministic approach pattern generator algorithm cryptography
Unable to display preview. Download preview PDF.
- 1.Bluetooth, Specifications of the Bluetooth system, Version 1.1 (February 2001), available at http://www.bluetooth.com/
- 3.GSM, Global Systems for Mobile Communications, available at http://cryptome.org/gsm-a512.htm
- 4.Golomb, S.W.: Shift Register-Sequences, Aegean Park Press, Laguna Hill (1982)Google Scholar
- 7.Mange, D.: Analysis and Synthesis of Logic Systems, Artech House, INC., Norwood (1986)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–562. Springer, Heidelberg (1990)Google Scholar
- 10.Nelson, V.P., et al.: Digital Logic Circuit Analysis and Design. Prentice-Hall International, Englewood Cliffs (1995)Google Scholar
- 13.Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, New York (1991)Google Scholar