Identification of Degeneracies in a Class of Cryptographic Sequences
In this work, the parameter linear complexity for a class of filtered sequences has been considered and analyzed. The study is based on the handling of bit-strings that permit identify potential degeneracies or linear complexity reductions in the sequences generated from this kind of nonlinear filters. Numerical expressions to determine the linear complexity of such sequences have been developed as well as design rules to generate sequences that preserve maximal linear complexity are also provided. The work complete the analysis of the linear complexity for these sequence generators found in the literature.
Keywordsfilter design pseudorandom sequence LFSR cryptography
Unable to display preview. Download preview PDF.
- 1.Bluetooth, Specifications of the Bluetooth system, Version 1.1, http://www.bluetooth.com/
- 2.eSTREAM, the ECRYPT Stream Cipher Project, Call for Primitives, http://www.ecrypt.eu.org/stream/
- 3.Fúster-Sabater, A., Caballero-Gil, P., Delgado-Mohatar, O.: Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol. 5544, pp. 621–630. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 4.Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)Google Scholar
- 11.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)Google Scholar
- 15.Paul, G., Maitra, S.: RC4 Stream Cipher and Its Variants. Discrete Mathematics and Its Applications. CRC Press, Taylor & Francis Group, Boca Raton (2012)Google Scholar
- 17.Yet Another SSL (YASSL), http://www.yassl.com