On Some Properties of the Shrinking Generator

Designs, Codes, and Cryptography

Volumn 23, Issue 2, 2001, Pages 147-156

  Shparlinski, Igor ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

Pseudorandom numbers; Recurring sequences

Indexed keywords

EID: 0035400678     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011256430812     Document Type: Article

References (9)

1. S. R. Blackburn, The linear complexity of the self-shrinking generator, IEEE Trans. on Inform. Theory, Vol. 45 (1999) pp. 2073-2077.
2. D. Coppersmith, H. Krawczyk and Y. Mansour, The shrinking generator, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 773 (1994) pp. 22-39.
3. J. D. Golić and L. O'Connor, Embedding and probabilistic correlation attacks on clock-controlled shift registers, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 950 (1995) pp. 230-243.
4. R. Lidl and H. Niederreiter, Finite fields, Addison-Wesley, MA (1983).
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publ. Comp. (1977).
6. W. Meier and O. Staffelbach, The self-shrinking generator, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 950 (1995) pp. 205-214.
7. I. E. Shparlinski, On some properties of linear cyclic codes, Problemy Peredachi Inform., Vol. 19, No. 3 (1983) pp. 106-110 (in Russian).
8. I. E. Shparlinski, On weigth spectra of some codes, Problemy Peredachi Inform., Vol. 22, No. 2 (1986) pp. 43-48 (in Russian).
9. I. E. Shparlinski, Finite fields: Theory and computation, Kluwer Acad. Publ., Dordrecht, The Netherlands (1999).