Brynielsson, Lennart, “On the linear complexity of combined shift register sequences”, Fst/TSA, Box 80001, S-10450, Stolkholm, Sweden, pp. 156-160, (1986). |
Chan et al., “Reconfigurable feedback shift registers”, ISIT, 1997. |
Gollmann, Dieter, “Pseudo Random Properties of Cascade Connections of Clock Controlled Shift Registers”, Lecture Notes in Computer Science, vol. 209, pp. 93-98, 1985. |
Gollmann, D, “Transformation matrices of clock-controlled shift registers”, Cryptography and Coding III, pp. 197-210, 1993. |
Jennings, S.M., “Multiplexed Sequences: some properties of the minimum polynomial”, Racal Research Ltd., Worton Grange Industrial Estate, Reading, Berks. RG2 OSB, England, pp. 189-206 (1983). |
Park, S-J et al., “On the security of the Gollmann cascades”, Crypto, pp. 148-156 (1995). |
Roggeman, Yves, “Remarks on the auto-correlation function of binary periodic sequences”, Cryptologia, vol. 10, No. 2, pp. 96-101, Apr. 1986. |
Roggeman, Yves, “Varying feedback shift registers”, Eurocrypt '89, Springer-Verlag, pp. 670-679 (1990). |
Rueppel et al., “Products of linear recurring sequences with maximum complexity”, IEEE Transactions on Information Theory, vol. IT-33, No. 1 pp. 124-131, Jan., 1987. |
Siegenthaler, T, “Correlation-immunity of non-linear combining functions for cryptographic applications”, IEEE Transactions on Information Theory, vol. IT-30, No. 5, pp. 776-780, Sep. 1984. |
Wakerly, J. Digital Design Principles and Practices, Prentice Hall, Englewood Cliffs, N.J., pp. 484-486, 1990. |
Zierler et al., “Products of linear recurring sequences”, Journal of Algebra, vol. 27, pp. 147-157, 1973. |