Information Technology Reference
In-Depth Information
11. Lempel, A., Eastman, W.L.: High Speed Generation of Maximal Length Sequences.
IEEE Transactions on Computer 2, 227-229 (1971)
12. Smeets, B.J.M., Chambers, W.G.: Windmill Generators: A Generalization and an
Observation of How Many There Are. In: Gunther, C.G. (ed.) EUROCRYPT 1988.
LNCS, vol. 330, pp. 325-330. Springer, Heidelberg (1988)
13. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)
14. Filiol, E.: Decimation Attack of Stream Ciphers. In: Roy, B., Okamoto, E. (eds.)
INDOCRYPT 2000. LNCS, vol. 1977, pp. 31-42. Springer, Heidelberg (2000)
15. Golomb, S.W.: Shift Register Sequences. Aegean Park Press (1981)
16. McEliece, R.J.: Finite field for scientists and engineers. Kluwer Academic Publish-
ers, Dordrecht (1987)
17. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-
Holland, Amsterdam (1998)
18. Massey, J.L., Rueppel, R.A.: Linear ciphers and random sequence generators with
multiple clocks. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984.
LNCS, vol. 209, pp. 74-87. Springer, Heidelberg (1985)
19. Zierler, N.: Linear recurring Sequences. Journal of the Society for Industrial and
Applied Mathematics 2, 31-48 (1959)
20. Goresky, M., Klapper, A., Murty, R., Shparlinski, I.: On Decimations of
-
Sequences. SIAM Journal of Discrete Mathematics 18(1), 130-140 (2004)
21. Goresky, M., Klapper, A.: Arithmetic crosscorrelations of feedback with carry shift
register sequences. IEEE Transactions on Information Theory 43(4), 1342-1345
(1997)
22. Xu, H., Qi, W.: Further Results on the Distinctness of Decimations of
-Sequences.
IEEE Transactions on Information Theory 52(8), 3831-3836 (2006)
23. Arnault, F., Berger, T.P.: F-fcsr: Design of a new class of stream ciphers. In:
Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 83-97. Springer,
Heidelberg (2005)
24. Muller, D.E., Preparata, F.P.: Bounds to complexities of networks for sorting and
switching. J. ACM 22, 1531-1540 (1975)
25. Hurd, W.: Ecient Generation of Statistically Good Pseudonoise by Linearly In-
terconnected Shift Registers. IEEE Transactions on Computer 2, 146-152 (1974)
26. Rueppel, R.A.: When Shift Registers Clock Themselves. In: Price, W.L., Chaum,
D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 53-64. Springer, Heidelberg
(1988)
27. Key, E.L.: An Analysis of the Structure and Complexity of Nonlinear Binary Se-
quence Generators. IEEE Transactions Information Theory 22(4), 732-736 (1976)
28. Berger, T.P., Minier, M.: Two Algebraic Attacks Against the F-FCSRs Using the
IV Mode. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT
2005. LNCS, vol. 3797, pp. 143-154. Springer, Heidelberg (2005)
29. Arnault, F., Berger, T.P.: Design and Properties of a New Pseudorandom Gen-
eratorBasedonaFilteredFCSRAutomaton.IEEETransactiononComput-
ers. 54(11), 1374-1383 (2005)
