Parallel generation of l-sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5203 LNCS, Issue , 2008, Pages 299-312

  Lauradoux, Cédric ^a   Röck, Andrea ^b  

^a Princeton University   (United States)

^b INRIA   (France)

Author keywords

Decimation; FCSRs; LFSRs; Parallelism; Sequences; Synthesis

Indexed keywords

FEEDBACK; SHIFT REGISTERS; SOLUTIONS;

DECIMATION; FCSRS; LFSRS; PARALLELISM; SEQUENCES; SYNTHESIS;

CONTROL THEORY;

EID: 56449125061     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85912-3_27     Document Type: Conference Paper

References (29)

1. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory 15, 122-127 (1969)
2. Feng, G.L., Tzeng, K.: A Generalization of the Berlekamp-Massey Algorithm for Multisequence Shift-Register Synthesis with Applications to Decoding Cyclic Codes. IEEE Transactions on Information Theory 37(5), 1274-1287 (1991)
3. Schmidt, G., Sidorenko, V.: Linear Shift-Register Synthesis for Multiple Sequences of Varying Length. In: IEEE International Symposium on Information Theory -ISIT 2006, pp. 1738-1742. IEEE, Los Alamitos (2006)
4. Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. Journal of Cryptology 10, 111-147 (1997)
5. Arnault, F., Berger, T.P., Necer, A.: Feedback with Carry Shift Registers synthesis with the Euclidean Algorithm. IEEE Transactions on Information Theory 50(5) (2004)
6. Klapper, A., Goresky, M.: 2-adic shift registers. In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 174-178. Springer, Heidelberg (1994)
7. Goresky, M., Klapper, A.: Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Transactions on Information Theory 48(11) (2002)
8. Goresky, M., Klapper, A.: Algebraic Shift Register Sequences (preprint)
9. Courtois, N., Meier, W.: Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345-359. Springer, Heidelberg (2003)
10. Arnault, F., Berger, T.P., Minier, M.: On the security of FCSR-based pseudorandom generators. In: State of the Art of Stream Ciphers - SASC (2007), http://sasc.crypto.rub.de/program.html
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 ol How Many There Are. in: Günther, 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 ol 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 Publishers, 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, L: On Decimations of l-Sequences. SIAM Journal ol 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 l-Sequences. IEEE Transactions on Information Theory 52(8), 3831-3836 (2006)
23. Arnault, F., Berger, T.P.: F-fcsr: Design of a new class ol 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.: Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected 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 Sequence 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 Generator Based on a Filtered FCSR. Automaton. IEEE Transaction on Computers. 54(11), 1374-1383 (2005)