Abstract
Binary sequences generated by nonlinearly filtering maximal length sequences with period 2n–1 are studied in this paper. We focus on the particular class of equidistant filters and provide improved lower bounds on the linear complexity of the filtered sequences. This is achieved by first considering and proving properties of generalised Vandermonde determinants. Furthermore, it is shown that the methodology developed can be used for studying properties of any nonlinear filter.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caballero-Gil, P.: Regular cosets and upper bounds on the linear complexity of certain sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications. Discrete Mathematics and Theoretical Computer Science, pp. 242–256. Springer, Berlin (1999)
Caballero-Gil, P., Fúster-Sabater, A.: A wide family of nonlinear filter functions with large linear span. Inform. Sci. 164, 197–207 (2004)
García-Villalba, L.J., Fúster-Sabater, A.: On the linear complexity of the sequences generated by nonlinear filterings. Inform. Process. Lett. 76, 67–73 (2000)
Golomb, S.W.: Shift Register Sequences. Holden-Day Inc., San Francisco (1967)
Göttfert, R., Niederreiter, H.: On the linear complexity of products of shift-register sequences. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 151–158. Springer, Heidelberg (1994)
Göttfert, R., Niederreiter, H.: On the minimal polynomial of the product of linear recurring sequences. Finite Fields Applic. 1, 204–218 (1995)
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 22, 732–736 (1976)
Kolokotronis, N., Kalouptsidis, N.: On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Inform. Theory 49, 3047–3059 (2003)
Lam, C., Gong, G.: A lower bound for the linear span of filtering sequences. In: State of the Art of Stream Ciphers – SASC (2004), pp. 220–233 (2004)
Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclop. Math. Its Applic., 2nd edn., vol. 20, Cambridge Univ. Press, Cambridge (1996)
Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. Oxford Univ. Press, Oxford (1995)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15, 122–127 (1969)
Massey, J.L., Serconek, S.: A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 332–340. Springer, Heidelberg (1994)
Paterson, K.G.: Root counting, the DFT and the linear complexity of nonlinear filtering. Des. Codes Cryptogr. 14, 247–259 (1998)
Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin (1986)
Shparlinski, I.E.: On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields Appl. 11, 193–199 (2005)
Tu, L.W.: A partial order on partitions and the generalised Vandermonde determinant. J. Algebra 278, 127–133 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolokotronis, N., Limniotis, K., Kalouptsidis, N. (2006). Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_23
Download citation
DOI: https://doi.org/10.1007/11863854_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44523-4
Online ISBN: 978-3-540-44524-1
eBook Packages: Computer ScienceComputer Science (R0)