Solving quadratic equations with XL on parallel architectures

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

Volumn 7428 LNCS, Issue , 2012, Pages 356-373

  Cheng, Chen Mou ^a   Chou, Tung ^b   Niederhagen, Ruben ^b   Yang, Bo Yin ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

block Wiedemann; Gr bner basis; multivariate quadratic systems; sparse solver; XL

Indexed keywords

BIT-OPERATIONS; BLOCK WIEDEMANN; COMPLEXITY ESTIMATES; CPU CORES; MULTIVARIATE QUADRATIC EQUATIONS; MULTIVARIATE QUADRATIC SYSTEMS; NUMA MACHINES; NUMBER FIELD SIEVE; QUADRATIC EQUATIONS; SMALL CLUSTERS; SPARSE MATRICES; SPARSE SOLVERS; STREAM CIPHERS; SYSTEM-SOLVERS; XL;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EMBEDDED SYSTEMS; HARDWARE; PARALLEL ARCHITECTURES; RANDOM ACCESS STORAGE;

CRYPTOGRAPHY;

EID: 84866710680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33027-8_21     Document Type: Conference Paper

References (23)

1. 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)
2. Coppersmith, D.: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm. Mathematics of Computation 62(205), 333-350 (1994)
3. Courtois, N.T.: 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)
4. 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)
5. Courtois, N.T., 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)
6. Diem, C.: The XL-Algorithm and a Conjecture from Commutative Algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 323-337. Springer, Heidelberg (2004)
7. 4). Journal of Pure and Applied Algebra 139(1-3), 61-88 (1999)
8. Faugère, J.-C.: A New Efficient Algorithm for Computing Gröbner Bases without Reduction to Zero (F5). In: ISSAC 2002, pp. 75-83. ACM (2002)
9. Faugère, J.-C., Perret, L., Petit, C., Renault, G.: Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 27-44. Springer, Heidelberg (2012)
10. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thomé, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-Bit RSA Modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333-350. Springer, Heidelberg (2010)
11. Lazard, D.: Gröbner-Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations. In: van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol. 162, pp. 146-156. Springer, Heidelberg (1983)
12. Macaulay, F.S.: The Algebraic Theory of Modular Systems. Cambridge Tracts in Mathematics and Mathematical Physics, vol. 19. Cambridge University Press (1916)
13. Moh, T.-T.: On the Method of XL and Its Inefficiency to TTM. Cryptology ePrint Archive, Report 2001/047 (2001), http://eprint.iacr.org/2001/047
14. Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 203-215. Springer, Heidelberg (2008)
15. Mohamed, W.S.A.E., Ding, J., Kleinjung, T., Bulygin, S., Buchmann, J.: PWXL: A Parallel Wiedemann-XL Algorithm for Solving Polynomial Equations Over GF(2). In: Cid, C., Faugère, J.-C. (eds.) SCC 2010, pp. 89-100 (2010)
16. Montgomery, P.L.: A Block Lanczos Algorithm for Finding Dependencies over GF(2). In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 106-120. Springer, Heidelberg (1995)
17. Murphy, S., Robshaw, M.J.B.: Essential Algebraic Structure within the AES. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 1-16. Springer, Heidelberg (2002)
18. Niederhagen, R.: Parallel Cryptanalysis. Ph.D. thesis, Eindhoven University of Technology (2012), http://polycephaly.org/thesis/index.shtml
19. Thomé, E.: Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. Journal of Symbolic Computation 33(5), 757-775 (2002)
20. Wiedemann, D.H.: Solving Sparse Linear Equations Over Finite Fields. IEEE Transactions on Information Theory 32(1), 54-62 (1986)
21. Yang, B.-Y., Chen, C.-H., Bernstein, D.J., Chen, J.-M.: Analysis of QUAD. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 290-308. Springer, Heidelberg (2007)
22. Yang, B.-Y., Chen, J.-M.: All in the XL Family: Theory and Practice. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 67-86. Springer, Heidelberg (2005)
23. Yang, B.-Y., Chen, J.-M., Courtois, N.T.: 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)