On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations - Sequences and Their Applications-SETA 2008 - page 366

20. Courtois, N.: Higher order correlation attacks, XL algorithm and cryptanalysis
of Toyocrypt. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp.
182-199. Springer, Heidelberg (2003)
21. Courtois, N., Debraize, B., Garrido, E.: On exact algebraic [non-]immunity of S-
boxes based on power functions. IACR e-print archive 2005/203
22. 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)
23. Courtois, N., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems
of equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 267-287.
Springer, Heidelberg (2002)
24. Daemen, J., Rijmen, V.: AES proposal: Rijndael (1999),
http://csrc.nist.gov/encryption/aes/rijndael/Rijndael.pdf
25. Dalai, D.K., Maitra, S., Sarkar, S.: Basic Theory in Construction of Boolean
Functions with Maximum Possible Annihilator Immunity. Designs, Codes Cryp-
togr. 40(1), 41-58 (2006),
http://eprint.iacr.org/
26. Dalai, D.K., Gupta, K.C., Maitra, S.: Cryptographically Significant Boolean func-
tions: Construction and Analysis in terms of Algebraic Immunity. In: Gilbert, H.,
Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 98-111. Springer, Heidelberg
(2005)
27. Didier, F.: A new upper bound on the block error probability after decoding over
the erasure channel. IEEE Trans. Inform. Theory 52, 4496-4503 (2006)
28. Dumer, I., Kabatiansky, G., Tavernier, C.: List decoding of Reed-Muller codes up
to the Johnson bound with almost linear complexity. In: Proceedings of ISIT 2006,
Seattle, USA (2006)
29. Fourquet, R.: Une FFT adaptee au decodage par liste dans les codes de Reed-Muller
d'ordres 1 et 2. Master-thesis of the University of Paris VIII, Thales communica-
tion, Bois Colombes (2006)
30. Fourquet, R.: Private communication (2007)
31. Fourquet, R., Tavernier, C.: An improved list decoding algorithm for the second
order Reed-Muller codes and its applications. Des. Codes Cryptogr (to appear,
2008)
32. Fourquet, R., Tavernier, C.: Private communication (2008)
33. Golic, J.: Fast low order approximation of cryptographic functions. In: Maurer,
U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 268-282. Springer, Heidel-
berg (1996)
34. Iwata, T., Kurosawa, K.: Probabilistic higher order differential attack and higher
orderbentfunctions.In:Lam,K.-Y.,Okamoto,E.,Xing,C.(eds.)ASIACRYPT
1999. LNCS, vol. 1716, pp. 62-74. Springer, Heidelberg (1999)
35. Kabatiansky, G., Tavernier, C.: List decoding of second order Reed-Muller codes.
In: Proc. 8 th Int. Symp. Comm. Theory and Applications, Ambleside, UK (July
2005)
36. Kaliski, B., Robshaw, M.: Linear cryptanalysis using multiple approximations. In:
Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 26-38. Springer, Heidel-
berg (1994)
37. Kasami, T., Tokura, N.: On the weight structure of Reed-Muller codes. IEEE Trans.
Inform. Theory IT-16 (6), 752-825 (1970)
38. Kasami, T., Tokura, N., Azumi, S.: On the weight enumeration of weights less than
2 . 5 d of Reed-Muller codes. Information and Control 30, 380-395 (1976)