Information Technology Reference
In-Depth Information
References
1. Courtois, N., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Sys-
tems of Equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp.
267-287. Springer, Heidelberg (2002)
2. 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)
3. 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)
4. Courtois, N., Meier, W.: Algebraic Attacks on Stream Ciphers with Linear Feed-
back. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345-359.
Springer, Heidelberg (2003)
5. Yang, B.-Y., Chen, J.-M.: Theoretical Analysis of XL over Small Fields. In: Wang,
H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 277-
288. Springer, Heidelberg (2004)
6. Yang, B.-Y., Chen, J.-M., Courtois, N.: On Asymptotic Security Estimates in
XL and Grobner Bases-Related Algebraic Cryptanalysis. In: Lopez, J., Qing, S.,
Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 401-413. Springer, Heidel-
berg (2004)
7. Yang, B.-Y., Chen, J.-M.: All in the XL Family: Theory and Practice. In: Park,
C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 67-86. Springer, Heidelberg
(2005)
8. Anderson, I.: A First Course in Combinatorial Mathematics, Theorem 2.6, 2nd
edn., p. 16. Oxford University Press, Oxford (1989)
9. van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, Theorem 13.1, 2nd edn.,
p. 119. Cambridge University Press, Cambridge (2001)
10. Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Ecient Algorithms for Solving
Overdefined Systems of Multivariate Polynomial Equations. In: Preneel, B. (ed.)
EUROCRYPT 2000. LNCS, vol. 1807, pp. 392-407. Springer, Heidelberg (2000)
11. Courtois, N., Patarin, J.: About the XL Algorithm over GF(2). In: Joye, M. (ed.)
CT-RSA 2003. LNCS, vol. 2612, pp. 141-157. Springer, Heidelberg (2003)
12. Ars, G., Faugre, J.C., Imai, H., Kawazoe, M., Sugita, M.: Comparison Between
XL and Grobner Basis Algorithms. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS,
vol. 3329, pp. 338-353. Springer, Heidelberg (2004)
13. Moh, T.: On The Method of “XL” And Its Ineciency to TTM, IACR eprint server
(2001), http://eprint.iacr.org/2001/047
14. Kipnis, A., Shamir, A.: Cryptanalysis of the HFE Public Key Cryptosystem by
Relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19-30.
Springer, Heidelberg (1999)
15. Macaulay, F.S.: On some formula in elimination. In: Proceedings of London Math-
ematical Society, pp. 3-27 (1902)
16. Bardet, M., Faugre, J.C., Salvy, B.: Complexity of Grobner basis computation for
Semi-regular Overdetermined sequences over F 2 , with solutions in F 2
Rapport de
recherche de l'INRIA, No. 5049 (2003)
17. Lazard, D.: Grobner-Bases, Gaussian Elimination and Resolution of Systems of
Algebraic Equations. In: van Hulzen, J.A. (ed.) EUROCAL 1983. LNCS, vol. 162,
pp. 146-156. Springer, Heidelberg (1983)
Search WWH ::




Custom Search