Abstract
As we have seen in the previous chapter a secure cipher need at least one nonlinear part. The natural way to proceed is to study nonlinear combinations of LFSRs. In this chapter we will meet for the first time the three big attack classes (correlation attacks, algebraic attacks, time-memory trade-off attacks). Which are central elements in the following chapters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Bull. Belg. Math. Soc. Simon Stevin 28, 203–217 (1951)
Bach, E.: Improved asymptotic formulas for counting correlation-immune Boolean functions. Technical report 1616, Computer Science Dept., University of Wisconsin (2007)
Bernasconi, J., Günter, C.G.: Analysis of nonlinear feedback logic for binary sequence generators. In: Advances in Cryptology—Eurocrypt ’85. LNCS, vol. 219, pp. 161–166 (1986)
Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Feigenbaum, J. (ed.) Advances in Cryptology—CRYPTO’91. Lecture Notes in Computer Science, vol. 576, pp. 86–100. Springer, Berlin (1992)
Camion, P., Canteaut, A.: Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations. In: Advances in Cryptology—CRYPTO ’96 (Santa Barbara, CA). Lecture Notes in Comput. Sci., vol. 1109, pp. 372–386. Springer, Berlin (1996)
Canfield, E.R., Gao, Z., Greenhill, C., McKay, B.D., Robinson, R.W.: Asymtotic enumeration of correlation-immune Boolean functions. Cryptogr. Commun. 2, 111–126 (2010). arXiv:0909.3321
Carlet, C., Gouget, A.: An upper bound on the number of m-resilient Boolean functions. In: ASIACRYPT 2002. LNCS, vol. 2501, pp. 484–496. Springer, Berlin (2002)
Carlet, C., Klapper, A.: Upper bounds on the number of reslient functions and of bent functions. In: Lecture Notes Dedicated to Philippe Desarte. Springer Verlag, to appear. A shorter version has appeared in the Proceedings of the 23rd Symposium on Information Theory in the Benelux, Louvain-La-Neuve, Belgian, 2002
de Bruijn, N.G.: A combinatorial problem. Nedel. Akad. Wetensch. Proc. 49, 758–764 (1946). other name: Indag. Math. 8, 461–467 (1946)
de Bruijn, N.G.: Acknowledgment of priority to C. Fyle Sainte-Marie on the counting of circular arrangements of 2n zeroes and ones that show each n-letter word exactly once. Technical Report TH-Report 75-WSK-06, Technolocical University Eidhoven, June 1975
Denisov, O.V.: An asymptotic formula for the number of correlation-immune boolean functions of order k. Discrete Appl. Math. 2(4), 407–426 (1992). English Translation from Diskr. Math. 3(2), 25–46 (1991)
Denisov, O.V.: A local limit theorem for the distribution of a part of the spectrum of a random binary function. Discrete Appl. Math. 10, 87–101 (2000). English Translation from Diskr. Math. 12, 1 (2000)
Geffe, P.R.: How to protect data with ciphers that are really hard to break. Electronics 4, 129–156 (1973)
Golić, J.Dj.: Cryptanalysis of the alleged A5 stream cipher. In: Advances in Cryptology—EUROCRYPTO ’97. LNCS, vol. 1233, pp. 239–255. Springer, Berlin (1997)
Good, I.J.: Normal recurring decimals. J. Lond. Math. Soc. 21(3), 169–172 (1946)
Gopalakrishnan, K., Stinson, D.R.: Three characterisations of non-binary correlation-immune and resilient functions. Des. Codes Cryptogr. 5, 241–251 (1995)
Mitchell, C.: Enumerating Boolean functions of cryptographic significance. J. Cryptol. 2, 155–170 (1990)
Palmer, E.M., Read, R.C., Robonson, R.W.: Balancing the n-cube: a census of colorings. J. Algebr. Comb. 1, 257–273 (1992)
de Riviére, A.: Question 48. l’Intermédiare des Mathématiciens 1, 19–20 (1894)
Rueppel, R.A.: Analysis and Design of Stream Chiphers. Springer, Berlin (1986)
Rueppel, R.A., Staffelbach, O.J.: Products of linear recurring sequences with maximum complexity. IEEE Trans. Inf. Theory 33, 124–131 (1987)
Sainte-Marie, Fly C.: Solution to question 48. l’Intermédiare des Mathématiciens 1, 107–110 (1894)
Schneider, M.: A Note on the Construction and Upper Bounds of Correlation-Immune Functions. LNCS, vol. 1355, 295–306 (1997)
Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. Inf. Theory 30, 776–780 (1984)
Tutte, W.T.: The dissection of equilateral triangles into equilateral triangles. Proc. Camb. Philos. Soc. 44, 463–482 (1948)
Xiao, G.Z., Massey, M.L.: A spectral characterisation of correlation immune combining functions. IEEE Trans. Inf. Theory 34, 569–571 (1988)
Yang, Y.X., Guo, B.: Further enumerating Boolean functions of cryptographic significance. J. Cryptol. 8, 115–122 (1995)
Zhang, J.Z., You, Z.S., Li, Z.L.: Enumeration of binary orthogonal arrays of strength 1. Discrete Math. 239, 191–198 (2001)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Klein, A. (2013). Non-linear Combinations of LFSRs. In: Stream Ciphers. Springer, London. https://doi.org/10.1007/978-1-4471-5079-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5079-4_3
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5078-7
Online ISBN: 978-1-4471-5079-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)