Abstract
Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that generates the given strings) of strings and the Kolmogorov complexity of strings. Though their results are correct, some of their proofs are incorrect. In this note, we demonstrate with a counterexample the reason why their proofs are incorrect and we prove a stronger result. We conclude our note with some comments on the use of the LIL test (the law of the iterated logarithm) for pseudorandom bits generated by pseudorandom generators.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beth, T., Dai, Z.-D.: On the complexity of pseudo-random sequences — or: If you can describe a sequence it cannot be random. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 533–543. Springer, Heidelberg (1990)
Chaitin, G.J.: On the length of programs for computing finite binary sequences. J. Assoc. Comput. Mach. 13, 547–569 (1966)
Chow, Y.S., Teicher, H.: Probability Theory. Springer, Heidelberg (1997)
Feller, W.: Introduction to Probability Theory and Its Applications, vol. I. John Wiley & Sons, Chichester (1968)
Golomb, S.W.: Shift Register Sequences, Holden-Day, San Francisco (1967)
Kolmogorov, A.N.: Three approaches to the definition of the concept quantity of information. Problemy Inform. Transmission 1, 3–7 (1965)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (1993)
Martin-Löf, P.: The definition of random sequences. Information and Control 9, 602–619 (1966)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory 15, 122–127 (1969)
Maurer, U.: A universal statistical test for random bit generators. Journal of Cryptology 5, 89–105 (1992)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Niederreiter, H.: The probability theory of linear complexity. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 191–209. Springer, Heidelberg (1988)
Rueppel, R.: Linear complexity and random sequences. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 167–188. Springer, Heidelberg (1986)
Rueppel, R.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)
Ville, J.: Etude Critique de la Notion de Collectif. Gauthiers-Villars, Paris (1939)
Wang, Y.: The law of the iterated logarithm for p-random sequences. In: Proc. 11th Conference on Computational Complexity (formerly: Conference on Structure in Complexity Theory), pp. 180–189. IEEE Computer Society Press, Los Alamitos (1996)
Wang, Y.: Randomness and Complexity. PhD thesis, Universität Heidelberg (1996)
Wang, Y.: Resource bounded randomness and computational complexity. To appear in Theoretical Computer Science (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y. (1999). Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result. In: Lam, KY., Okamoto, E., Xing, C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48000-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-48000-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66666-0
Online ISBN: 978-3-540-48000-6
eBook Packages: Springer Book Archive