Linear complexity of generalized cyclotomic binary sequences of order 2

Finite Fields and their Applications

Volumn 3, Issue 2, 1997, Pages 159-174

  Ding, Cunsheng ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031117229     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.1997.0181     Document Type: Article

References (20)

1. Baumert L. D. Cyclic Difference Sets. Lecture Notes in Mathematics. 182:1971;Springer-Verlag, New York/Berlin.
2. Blum L., Blum M., Shub M. A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15:1986;364-383.
3. Ding C., Xiao G., Shan W. The Stability Theory of Stream Ciphers. Lect. Notes in Comput. Sci. 561:1991;Springer-Verlag, New York/Berlin.
4. Ding C. Binary cyclotomic generators. Preneel B. Fast Software Encryption. Lect. Notes in Comput. Sci. 1008:1995;29-60 Springer-Verlag, New York/Berlin.
5. Ding C., Pei D., Salomaa A. Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography. 1996;World Scientific, Singapore.
6. Gauss C. F. Disquisitiones Arithmeticae. 1966;Yale Univ. Press, New Haven.
7. 1986, Springer-Verlag, Berlin/Heidelberg/New York, CT.
8. Lidl R., Niederreiter H. Finite Fields. 1983;Addison-Wesley, Reading.
9. Niederreiter H. Sequences with almost perfect linear complexity profile. Advances in Cryptology: Proc. Eurocrypt'87. Lect. Notes in Comput. Sci. 304:1988;Springer-Verlag, New York/Berlin. p. 37-51.
10. Niederreiter H. Keystream sequences with a good linear complexity profile for every starting point. Advances in Cryptology: Proc. Eurocrypt'89. Lect. Notes in Comput. Sci. 434:1990;Springer-Verlag, New York/Berlin. p. 523-532.
11. Niederreiter H. A combinatorial approach to probabilistic results on the linear complexity profile of random sequences. J. Cryptology. 2:1990;105-112.
12. Niederreiter H. The linear complexity profile and the jump complexity of keystream sequences. Advances in Cryptology: Proc. Eurocrypt'90. Lect. Notes in Comput. Sci. 473:1991;Springer-Verlag, New York/Berlin. p. 174-188.
13. Rogaway P., Coppersmith D. A software-oriented encryption algorithm. Fast Software Encryption. Lect. Notes in Comput. Sci. 809:1994;Springer-Verlag, New York/Berlin. p. 56-63.
14. Rueppel R. A. Linear complexity and random sequences. Advances in Cryptology: Eurocrypt'85. Lect. Notes in Comput. Sci. 219:1986;Springer-Verlag, New York/Berlin. p. 167-188.
15. Schneier B. Applied Cryptography. 1996;Wiley, New York.
16. Siegenthaler T. Decrypting a class of stream ciphers using ciphertext only. IEEE Trans. Comput. C-34:1985;81-85.
17. Siegenthaler T. Cryptanalyst's representation of nonlinearly filtered ml-sequences. Pichler F. Advances in Cryptology: Proc. of Eurocrypt'85. Lect. Notes in Comput. Sci. 219:1986;103-110 Springer-Verlag, New York/Berlin.
18. Storer T. Cyclotomy and Difference Sets. 1967;Markham, Chicago.
19. Wheeler D. J. A bulk data encryption algorithm. Fast Software Encryption. Lect. Notes in Comput. Sci. 809:1994;Springer-Verlag, New York/Berlin. p. 127-134.
20. Whiteman A. L. A family of difference sets. Illinois J. Math. 6:1962;107-121.