Cryptography Reference
In-Depth Information
References
1. Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.: Algebraic immunity for crypto-
graphically significant Boolean functions: analysis and construction. IEEE Trans.
Inf. Theory 52(7), 3105-3121 (2006)
2. 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)
3. Dalai, D.K., Maitra, 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)
4. Dalai, D.K., Maitra, S., Sarkar, S.: Baisc theory in construction of Boolean func-
tions with maximum possible annihilator immunity. Des. Codes Cryptogr 40(1),
41-58 (2006)
5. Li, N., Qi, W.-F.: Construction and Analysis of Boolean Functions of 2
t
+1 Vari-
ables with Maximum Algebraic Immunity. In: Lai, X., Chen, K. (eds.) ASIACRYPT
2006. LNCS, vol. 4284, pp. 84-98. Springer, Heidelberg (2006)
6. Pasalic, E.: Almost Fully Optimized Infinite Classes of Boolean Functions Resistant
to (Fast) Algebraic Cryptanalysis. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008.
LNCS, vol. 5461, pp. 399-414. Springer, Heidelberg (2009)
7. Carlet, C., Feng, K.: An infinite class of balanced functions with optimal alge-
braic immunity, good immunity to fast algebraic attacks and good nonlinearity.
In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425-440. Springer,
Heidelberg (2008)
8. Tu, Z., Deng, Y.: A Conjecture on Binary String and its Application on con-
structing Boolean Functions of Optimal Algebraic Immunity. Des. Codes Cryptogr
(2010), Online First Articles. doi:10.1007/s10623-010-9413-9
9. Carlet, C., Feng, K.: An Infinite Class of Balanced Vectorial Boolean Functions
with Optimum Algebraic Immunity and Good Nonlinearity. In: Chee, Y.M., Li,
C., Ling, S., Wang, H., Xing, C. (eds.) IWCC 2009. LNCS, vol. 5557, pp. 1-11.
Springer, Heidelberg (2009)
10. Courtois, N.: Fast Algebraic attacks on stream ciphers with linear feedback. In:
Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176-194. Springer, Heidelberg
(2003)
11. Courtois, N., Bard, G.: Algebraic Cryptanalysis of the Data Encryption Standard.
In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp.
152-169. Springer, Heidelberg (2007)
12. 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)
13. Armknecht, F., Krause, M.: Algebraic Attacks on Combiners with Memory. In:
Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 162-175. Springer, Heidelberg
(2003)
14. Meier, W., Staffelbach, O.: Fast correlation attacks on stream ciphers. In: Gunther,
C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 301-314. Springer, Heidelberg
(1988)
15. Johansson, T., Jonsson, F.: Fast Correlation Attacks through Reconstruction of
Linear Polynomials. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp.
300-315. Springer, Heidelberg (2000)
Search WWH ::
Custom Search