Fast exhaustive search for polynomial systems in F2

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

Volumn 6225 LNCS, Issue , 2010, Pages 203-218

  Bouillaguet, Charles ^a   Chen, Hsieh Chung ^b   Cheng, Chen Mou ^c   Chou, Tung ^c   Niederhagen, Ruben ^c,d   Shamir, Adi ^a,e   Yang, Bo Yin ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^e WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Exhaustive search; Graphic Processing Units (GPUs); Multivariate polynomials; Parallelization; Solving systems of equations

Indexed keywords

BUDGET CONTROL; CRYPTOGRAPHY; GRAPHICS PROCESSING UNIT; PROGRAM PROCESSORS; SMART CARDS;

EXHAUSTIVE SEARCH; GRAPHIC PROCESSING UNITS (GPUS); MULTIVARIATE POLYNOMIAL; PARALLELIZATIONS; SYSTEMS OF EQUATIONS;

EMBEDDED SYSTEMS;

EID: 78049336783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15031-9_14     Document Type: Conference Paper

References (26)

1. Bard, G. V., Courtois, N. T., Jefferson, C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF (2) via SAT-solvers, http://eprint.iacr.org/2007/024
2. Bardet, M., Faugère, J.-C., Salvy, B.: On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. In: Proc. Int'l Conference on Polynomial System Solving, pp. 71-74 (2004) INRIA report RR-5049
3. Bardet, M., Faugère, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In: Proc. MEGA 2005(2005)
4. Berbain, C., Gilbert, H., Patarin, J.: QUAD: A practical stream cipher with provable security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 109-128. Springer, Heidelberg (2006)
5. Bernstein, D. J., Chen, T.-R., Cheng, C.-M., Lange, T., Yang, B.-Y: ECM on graphics cards. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 483-501. Springer, Heidelberg (2010)
6. Bettale, L., Faugére, J.-C., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. J. Math. Crypto. 3(3), 177-197 (2009)
7. Bouillaguet, C., Faugére, J.-C., Fouque, P.-A., Perret, L.: Differential-algebraic algorithms for the isomorphism of polynomials problem, http://eprint.iacr.org/2009/583
8. Bouillaguet, C., Fouque, P.-A., Joux, A., Treger, J.: A family of weak keys in HFE (and the corresponding practical key-recovery), http://eprint.iacr. org/2009/619
9. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)
10. Buchmann, J., Cabarcas, D., Ding, J., Mohamed, M. S. E.: Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over F. In: Bernstein, D. J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 69-81. Springer, Heidelberg (2010)
11. Courtois, N., Bard, G. V., Wagner, D.: Algebraic and slide attacks on Keeloq. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 97-115. Springer, Heidelberg (2008)
12. Courtois, N., Goubin, L., Patarin, J.: SFLASH: Primitive specification (second revised version) (2002), https://www.cosic.esat.kuleuven.be/nessie
13. Courtois, N. T., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392-407. Springer, Heidelberg (2000), Extended ver., http://www.minrank.org/xlfull.pdf
14. de Bruijn, N.: Asymptotic methods in analysis. 2nd edition. Bibliotheca Mathematica. Vol. 4., 200 p. P. Noordhoff Ltd. XII, Groningen (1961)
15. 4). J. of Pure and Applied Algebra 139, 61-88 (1999)
16. 5). In: ACM ISSAC 2002, pp. 75-83 (2002)
17. Faugère, J.-C., Joux, A.: Algebraic cryptanalysis of Hidden Field Equations (HFE) using Gröbner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44-60. Springer, Heidelberg (2003)
18. Fog, A.: Instruction Tables. Copenhagen University, College of Engineering, Lists of Instruction Latencies, Throughputs and micro-operation breakdowns for Intel, AMD, and VIA CPUs (February 2010), http://www.agner.org/ optimize/instruction-tables.pdf
19. Patarin, J.: Asymmetric cryptography with a hidden monomial. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 45-60. Springer, Heidelberg (1996)
20. Patarin, J.: Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33-48. Springer, Heidelberg (1996), Extended ver.: http://www.minrank.org/hfe.pdf
21. Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 282-297. Springer, Heidelberg (2001), http://www.minrank.org/quartz/
22. Patarin, J., Goubin, L., Courtois, N.: Improved algorithms for Isomorphisms of Polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 184-200. Springer, Heidelberg (1998); Extended ver.: http://www.minrank.org/ip6long.ps
23. Raddum, H.: MRHS equation systems. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 232-245. Springer, Heidelberg (2007)
24. Sugita, M., Kawazoe, M., Perret, L., Imai, H.: Algebraic cryptanalysis of 58-round SHA-1. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 349-365. Springer, Heidelberg (2007)
25. 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)
26. Yang, B.-Y., Chen, J.-M., Courtois, N.: On Asymptotic Security Estimates in XL and Gröbner Bases-Related Algebraic Cryptanalysis. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 401-413. Springer, Heidelberg (2004)