Algebraic cryptanalysis of curry and flurry using correlated messages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6151 LNCS, Issue , 2010, Pages 266-277

  Faugère, Jean Charles ^a   Perret, Ludovic ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC ATTACK; ALGEBRAIC CRYPTANALYSIS; ALGEBRAIC SYSTEM; BLOCK CIPHERS; DIFFERENTIAL CRYPTANALYSIS; HIGH ORDER; INVERSE FUNCTIONS; NEW APPROACHES; ONE STEP; POWER FUNCTIONS; PROOF OF CONCEPT; SOUND DESIGNS; STATISTICAL ATTACKS; THEORETICAL COMPLEXITY;

ALGEBRA; CRYPTOGRAPHY; LYAPUNOV METHODS;

SECURITY OF DATA;

EID: 78650199597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16342-5_19     Document Type: Conference Paper

References (35)

1. Albrecht, M., Cid, C.: Algebraic Techniques in Differential Cryptanalysis, http://eprint.iacr.org/2007/137
2. Albrecht, M., Cid, C.: Algebraic Techniques in Differential Cryptanalysis. In: Proceedings of the First International Conference on Symbolic Computation and Cryptography, SCC 2008, Beijing, China (April 2008)
3. Ars, G., Faugère, J.-C., Imai, H., Kawazoe, M., Sugita, M.: Comparison Between XL and Gröbner Basis Algorithms. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 338-353. Springer, Heidelberg (2004)
4. Ars, G.: Applications des Bases de Gröbner á la Cryptographie. Thèse de doctorat, Université de Rennes I (2004)
5. Bardet, M.: Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et á la cryptographie. Thèse de doctorat, Université de Paris VI (2004)
6. Bardet, M., Faugère, J.-C., Salvy, B.: On the Complexity of Gröbner Basis Computation of Semi-Regular Overdetermined Algebraic Equations. In: Proc. of International Conference on Polynomial System Solving (ICPSS), pp. 71-75 (2004)
7. Bardet, M., Faugère, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In: Proc. of MEGA 2005, Eighth Inter. Symposium on Effective Methods in Algebraic Geometry (2005)
8. Biham, E., Shamir, A.: Differential Cryptanalysis of DES-like Cryptosystems. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2-21. Springer, Heidelberg (1991)
9. Biham, E., Shamir, A.: Differential Cryptanalysis of of the Full 16-round DES. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 487-496. Springer, Heidelberg (1993)
10. Buchberger, B.: Ein algorithmisches Kriterium fur die Lösbarkeit eines algebraischen Gleichungssystems (An Algorithmical Criterion for the Solvability of Algebraic Systems of Equations). Aequationes mathematicae 4(3), 374-383 (1970);
11. English translation in: Buchberger, B., Winkler, F. (eds.) Grobner Bases and Applications. In: Proceedings of the International Conference 33 Years of Gröbner Bases, RISC, Austria. Lecture Note Series, vol. 251, pp. 535-545. London Mathematical Society, Cambridge University Press (1998)
12. Buchmann, J., Pyshkin, A., Weinmann, R.-P.: Block Ciphers Sensitive to Gröbner Basis Attacks. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 313-331. Springer, Heidelberg (2006)
13. Buchmann, J., Pyshkin, A., Weinmann, R.-P.: Block Ciphers Sensitive to Gröbner Basis Attacks - Extended version, http://eprint.iacr.org/2005/200
14. Buchmann, J., Pyshkin, A., Weinmann, R.-P.: A Zero-Dimensional Gröbner Basis for AES-128. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 78-88. Springer, Heidelberg (2006)
15. 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)
16. 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)
17. 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)
18. Cid, C., Murphy, S., Robshaw, M.J.B.: Small Scale Variants of the AES. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 145-162. Springer, Heidelberg (2005)
19. Cid, C., Murphy, S., Robshaw, M.J.B.: Algebraic Aspects of the Advanced Encryption Standard. Springer, Heidelberg (2006)
20. Cid, C., Albrecht, M., Augot, D., Canteaut, A.,Weinmann, R.-P.: Algebraic Cryptanalysis of Symmetric Primitives. In: Deliverable STVL, ECRYPT - European Network of Excellence Collaborations (July 2008), http://hal.archives-ouvertes. fr/docs/00/32/86/26/PDF/D-STVL-7.pdf
21. Cid, C., Leurent, G.: An Analysis of the XSL Algorithm. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 333-352. Springer, Heidelberg (2005)
22. Cox, D.A., Little, J.B., O'Shea, D.: Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative algebra. In: Undergraduate Texts in Mathematics. Springer, New York (1992)
23. Faugère, J.C., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero- Dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation 16(4), 329-344 (1993)
24. 4. Journal of Pure and Applied Algebra 139, 61-68 (1999)
25. 5. In: Proceedings of ISSAC, pp. 75-83. ACM Press, New York (July 2002)
26. Faugère, J.-C., Joux, A.: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems using Gröbner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44-60. Springer, Heidelberg (2003)
27. Faugère, J.-C., Perret, L.: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 30-47. Springer, Heidelberg (2006)
28. - Schemes. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 357-372. Springer, Heidelberg (2006)
29. Faugère, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 280-296. Springer, Heidelberg (2008)
30. Garey, M.R., Johnson, D.B.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
31. Knudsen, L.R.: Truncated and Higher Order Di fferentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196-211. Springer, Heidelberg (1995)
32. Lai, X.: Higher Order Derivatives and Differential Cryptanalysis. In: Communications and Cryptography, pp. 227-233. Kluwer Academic Publishers, Dordrecht (1994)
33. Lim, C.-W., Khoo, K.: An Analysis of XSL Applied to BES. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 242-253. Springer, Heidelberg (2007)
34. Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386-397. Springer, Heidelberg (1994)
35. Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Information Theory IT-32, 54-62 (1986)