Abstract
We discuss the problem of counting the number of primitive transformation shift registers and its equivalent formulation in terms of Singer cycles in a corresponding general linear group. We also introduce the notion of word-oriented nonlinearly filtered primitive transformation shift registers based on a Langford arrangement and study their linear complexity.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, Discrete Mathematics and its Applications, 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Dewar, M., Panario, D.: Linear transformation shift registers. IEEE Trans. Inform. Theory 49(8), 2047–2052 (2003)
Dewar, M., Panario, D.: Mutual Irreducibility of Certain Polynomials. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Fq7 2003. LNCS, vol. 2948, pp. 59–68. Springer, Heidelberg (2004)
Dewar, M., Panario, D.: Tables for linear transformation shift registers, http://www.math.carleton.ca/~daniel/research/tsr/
Gao, F., Yang, Y., Tan, G.: Some results on word-oriented nonlinear feedback shift registers. In: The Proceedings of International Conference on Electronics and Optoelectronics (ICEOE 2011), pp. V4-357–V4-359 (2011)
Ghorpade, S.R., Hasan, S.U., Kumari, M.: Primitive polynomials, Singer cycles, and word oriented linear feedback shift registers. Des. Codes Cryptogr. 58(2), 123–134 (2011)
Ghorpade, S.R., Ram, S.: Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields. Finite Fields Appl. 17(5), 461–472 (2011)
Ghorpade, S.R., Ram, S.: Enumeration of splitting subspaces over finite fields. To Appear in: Aubry, Y., Ritzenthaler, C., Zykin, A. (eds.) Arithmetic, Geometry, Cryptography and Coding Theory, Luminy, France. Contemp. Math. Amer. Math. Society (2011)
Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967)
Golomb, S.W., Gong, G.: Signal Design for Good Correlation. Cambridge University Press (2005)
Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory 17, 288–296 (1971)
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)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1983)
Niederreiter, H.: Factorization of polynomials and some linear-algebra problems over finite fields. Linear Algebra Appl. 192, 301–328 (1993)
Niederreiter, H.: The multiple-recursive matrix method for pseudorandom number generation. Finite Fields Appl. 1, 3–30 (1995)
Niederreiter, H.: Pseudorandom vector generation by the multiple-recursive matrix method. Math. Comp. 64, 279–294 (1995)
Niederreiter, H.: Improved bound in the multiple-recursive matrix method for pseudorandom number and vector generation. Finite Fields Appl. 2, 225–240 (1996)
Preneel, B.: Introduction to the Proceedings of the Second Workshop on Fast Software Encryption. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 1–5. Springer, Heidelberg (1995)
Tsaban, B., Vishne, U.: Efficient feedback shift registers with maximal period. Finite Fields Appl. 8, 256–267 (2002)
Zeng, G., Han, W., He, K.: Word-oriented feedback shift register: σ-LFSR (Cryptology ePrint Archive: Report 2007/114), http://eprint.iacr.org/2007/114
Zeng, G., Yang, Y., Han, W., Fan, S.: Word Oriented Cascade Jump σ−LFSR. In: Bras-Amorós, M., Høholdt, T. (eds.) AAECC 2009. LNCS, vol. 5527, pp. 127–136. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasan, S.U., Panario, D., Wang, Q. (2012). Word-Oriented Transformation Shift Registers and Their Linear Complexity. In: Helleseth, T., Jedwab, J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30615-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-30615-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30614-3
Online ISBN: 978-3-642-30615-0
eBook Packages: Computer ScienceComputer Science (R0)