Information Technology Reference
In-Depth Information
2. Armknecht, F., Krause, M.: Constructing single- and multi-output boolean func-
tions with maximal immunity. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener,
I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 180-191. Springer, Heidelberg (2006)
3. Baigneres, T., Junod, P., Vaudenay, S.: How far can we go beyond linear crypt-
analysis? In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 432-450.
Springer, Heidelberg (2004)
4. Braeken, A., Preneel, B.: On the Algebraic Immunity of Symmetric Boolean Func-
tions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT
2005. LNCS, vol. 3797, pp. 35-48. Springer, Heidelberg (2005),
5. Carlet, C.: The monograph Boolean Methods and Models. In: Crama, Y., Ham-
mer, P. (eds.) Boolean Functions for Cryptography and Error Correcting Codes.
Cambridge University Press, Cambridge (to appear),
6. Carlet, C.: The monography Boolean Methods and Models. In: Crama, Y., Ham-
mer, P. (eds.) Vectorial (multi-output) Boolean Functions for Cryptography. Cam-
bridge University Press, Cambridge (to appear),
7. Carlet, C.: The complexity of Boolean functions from cryptographic viewpoint.
Dagstuhl Seminar. Complexity of Boolean Functions (2006),
8. Carlet, C.: On the higher order nonlinearities of algebraic immune functions. In:
Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 584-601. Springer, Heidel-
berg (2006)
9. Carlet, C.: Recursive Lower Bounds on the Nonlinearity Profile of Boolean Func-
tions and Their Applications. IEEE Trans. Inform. Theory 54(3), 1262-1272 (2008)
10. Carlet, C.: A method of construction of balanced functions with optimum algebraic
immunity. In: The Proceedings of the International Workshop on Coding and Cryp-
tography, The Wuyi Mountain, Fujiang, China, June 11-15, 2007. Series of Coding
and Cryptology, vol. 4, World Scientific Publishing Co., Singapore (2008)
11. Carlet, C., Dalai, D., Gupta, K., Maitra, S.: Algebraic Immunity for Cryptograph-
ically Significant Boolean Functions: Analysis and Construction. IEEE Trans. In-
form. Theory 52(7), 3105-3121 (2006)
12. Carlet, C., Ding, C.: Nonlinearities of S-boxes. Finite Fields and its Applica-
tions 13(1), 121-135 (2007)
13. Carlet, C., Feng, K.: New balanced Boolean functions satisfying all the main cryp-
tographic criteria. IACR cryptology e-print archive 2008/244
14. Carlet, C., Mesnager, S.: Improving the upper bounds on the covering radii of
binary Reed-Muller codes. IEEE Trans. on Inform. Theory 53, 162-173 (2007)
15. Carlitz, L., Uchiyama, S.: Bounds for exponential sums. Duke Math. Journal 1,
37-41 (1957)
16. Chabaud, F., Vaudenay, S.: Links between Differential and Linear Cryptanalysis.
In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356-365. Springer,
Heidelberg (1995)
17. Charpin, P., Helleseth, T., Zinoviev, V.: Propagation characteristics of
x → x
−
1
and Kloosterman sums. Finite Fields and their Applications 13(2), 366-381 (2007)
18. Cheon, J.H., Lee, D.H.: Resistance of S-Boxes against Algebraic Attacks. In: Roy,
B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 83-94. Springer, Heidelberg
(2004)
19. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. North-Holland,
Amsterdam (1997)
