References
- A. Menezes, P. van Oorschot, and S. Vanstone, : Handbook of Applied Cryptography, CRC Press, 1996.
- Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967).
- Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory 17, 288–296 (1971).
- J. L. Massey, Shirlei Serconek,: A Fourier Transform Approach to the Linear Complexity of Nonlinear Filtered Sequences, Advances in Cryptology-Cryptoʾ94, LNCS, PP.332-340,1994, Springer-Verlag Berlin Heidelberg 1994.
- J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
- Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory 6, 732–736 1976.
- Langford, C.D.: Problem. Math. Gaz. 42, 228 (1958).
- R. A. Rueppel,: Analysis and design of stream Cipher, Berlin: springer-Verlag, 1986.
- R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge Univ. Press, 1986.
- Sartaj Ul Hasan, Daniel Panario and Qiang Wang,: Word-oriented transformation shift registers and their linear complexity, in Proceedings of Sequences and Their Applications-SETA 2012, T. Helleseth and J. Jedwab Eds., Lecture Notes in Computer Science, Springer, Berlin, Vol. 7280 (2012), pp. 190–202.
- Zeng, G., Han, W., He, K.: Word-oriented feedback shift register: σ-LFSR (Cryptology ePrint Archive: Report 2007/114), http://eprint.iacr.org/2007/114.