Skip to main content
SpringerLink
Log in

Parallel Generation of ℓ-Sequences

  • Conference paper
Sequences and Their Applications - SETA 2008 (SETA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5203))

Included in the following conference series:

Abstract

The generation of pseudo-random sequences at a high rate is an important issue in modern communication schemes. The representation of a sequence can be scaled by decimation to obtain parallelism and more precisely a sub-sequences generator. Sub-sequences generators and therefore decimation have been extensively used in the past for linear feedback shift registers (LFSRs). However, the case of automata with a non linear feedback is still in suspend. In this paper, we have studied how to transform of a feedback with carry shit register (FCSR) into a sub-sequences generator. We examine two solutions for this transformation, one based on the decimation properties of ℓ-sequences, i.e. FCSR sequences with maximal period, and the other one based on multiple steps implementation. We show that the solution based on the decimation properties leads to much more costly results than in the case of LFSRs. For the multiple steps implementation, we show how the propagation of carries affects the design.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory 15, 122–127 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  4. Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. Journal of Cryptology 10, 111–147 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  6. Klapper, A., Goresky, M.: 2-adic shift registers. In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 174–178. Springer, Heidelberg (1994)

    Google Scholar 

  7. Goresky, M., Klapper, A.: Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Transactions on Information Theory 48(11) (2002)

    Google Scholar 

  8. Goresky, M., Klapper, A.: Algebraic Shift Register Sequences (preprint)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  12. Smeets, B.J.M., Chambers, W.G.: Windmill Generators: A Generalization and an Observation of How Many There Are. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 325–330. Springer, Heidelberg (1988)

    Google Scholar 

  13. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  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)

    Google Scholar 

  15. Golomb, S.W.: Shift Register Sequences. Aegean Park Press (1981)

    Google Scholar 

  16. McEliece, R.J.: Finite field for scientists and engineers. Kluwer Academic Publishers, Dordrecht (1987)

    Google Scholar 

  17. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland, Amsterdam (1998)

    Book  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  19. Zierler, N.: Linear recurring Sequences. Journal of the Society for Industrial and Applied Mathematics 2, 31–48 (1959)

    Article  MathSciNet  Google Scholar 

  20. Goresky, M., Klapper, A., Murty, R., Shparlinski, I.: On Decimations of ℓ-Sequences. SIAM Journal of Discrete Mathematics 18(1), 130–140 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Goresky, M., Klapper, A.: Arithmetic crosscorrelations of feedback with carry shift register sequences. IEEE Transactions on Information Theory 43(4), 1342–1345 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  22. Xu, H., Qi, W.: Further Results on the Distinctness of Decimations of ℓ-Sequences. IEEE Transactions on Information Theory 52(8), 3831–3836 (2006)

    Article  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  24. Muller, D.E., Preparata, F.P.: Bounds to complexities of networks for sorting and switching. J. ACM 22, 1531–1540 (1975)

    Article  MathSciNet  Google Scholar 

  25. Hurd, W.: Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers. IEEE Transactions on Computer 2, 146–152 (1974)

    Article  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of electrical engineering, Princeton University, Princeton, NJ 08544, USA

    Cédric Lauradoux

  2. Team SECRET, INRIA Paris-Rocquencourt, 78153, Le Chesnay Cedex, France

    Andrea Röck

Authors
  1. Cédric Lauradoux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Röck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Solomon W. Golomb Matthew G. Parker Alexander Pott Arne Winterhof

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lauradoux, C., Röck, A. (2008). Parallel Generation of ℓ-Sequences. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85912-3_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85911-6

  • Online ISBN: 978-3-540-85912-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation