1.

Andersen Henning E.: On puncturing of codes from Norm-Trace curves. Finite Fields Appl.

**1**, 136–157 (2007)

CrossRefGoogle Scholar2.

Buchberger B.: Bruno Buchberger’s PhD thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput.

**41**, 475–511 (2006)

MATHCrossRefMathSciNetGoogle Scholar3.

Cid, C., Leurent, G.: An analysis of the XSL algorithm. In: Roy, B.K. (ed.) Advances in Cryptology—ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4–8, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3788, pp. 333–352. Springer (2005)

4.

Cid, C., Murphy, S., Robshaw, M.J.B.: Small scale variants of the AES. In: Gilbert, H., Handschuh, H. (eds.) Fast Software Encryption, 12th International Workshop, Paris,France. Lecture Notes in Computer Science, vol. 3557, pp. 145–162. Springer (2005)

5.

Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) Advances in Cryptology—EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4–8, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2656, pp. 345–359. Springer (2003)

6.

Courtois, N.T., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) Advances in Cryptology—EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14–18, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1807, pp. 392–407. Springer (2000)

7.

Courtois, N.T., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined system of equations. In: Zheng, Y. (ed.) Advances in Cryptology—ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1–5, 2002, Proceedings. Lecture Notes in Computer Science, vol. 2501, pp. 267–287. Springer (2002)

8.

Cox D., Little J., OShea D.: Using Algebraic Geometry, 1st edn. Springer, New York (1998)

MATHGoogle Scholar9.

Cox D., Little J., OShea D.: Ideals, Varieties, and Algorithms, An Introduction to Computational Geometry and Commutative Algebra, 2nd edn. Springer, New York (2005)

Google Scholar10.

Diem, C.: The XL-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) Advances in Cryptology—ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5–9, 2004, Proceedings. Lecture Notes in Computer Science, vol. 3329, pp. 323–337. Springer (2004)

11.

Lim, C.-W., Khoo, K.: An analysis of XSL applied to BES. In: Biryukov, A. (ed.) Fast Software Encryption, 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26–28, 2007, Revised Selected Papers. Lecture Notes in Computer Science, vol. 4593, pp. 242–253. Springer (2007)