Sparse algebraic equations over finite fields

SIAM Journal on Computing

Volumn 39, Issue 2, 2009, Pages 388-409

  Semaev, Igor ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Agreeing; Finite fields; Gluing; Sparse algebraic equations

Indexed keywords

AGREEING; ALGEBRAIC EQUATIONS; BOOLEAN EQUATIONS; FINITE FIELDS; HARD PROBLEMS; RANDOM INSTANCE; RUNNING TIME; SAT-SOLVING; SPARSE ALGEBRAIC EQUATIONS; THEORETICAL BOUNDS; WORST-CASE COMPLEXITY;

CRYPTOGRAPHY; GLUING;

ALGEBRA;

EID: 67650118825     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070700371     Document Type: Article

References (17)

1. 2, Research Report RR-5049, INRIA, 2003.
2. E. T. COPSON, Asymptotic Expansions, Cambridge University Press, Cambridge, UK, 1965.
3. N. COURTOIS, A. KLIMOV, J. PATARIN, AND A. SHAMIR, Efficient algorithms for solving overdefined systems of multivariate polynomial equations, in Advances in Cryptology-EURO-CRYPT 2000, Lecture Notes in Comput. Sci. 1807, Springer-Verlag, Berlin, 2000, pp. 392-407.
4. M. DAVIS AND H. PUTNAM, A computing procedure for quantification theory, J. ACM, 7 (1960), pp. 201-215.
5. M. DAVIS, G. LOGEMANN, AND D. LOVELAND, A machine program for theorem proving, Comm. ACM, 5 (1962), pp. 394-397.
6. J.-C. FAUGÈRE, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5), in Proceedings of the 2002 International Conference on Symbolic and Algebraic Computation (ISSAC 2002), ACM Press, New York, 2002, pp. 75-83.
7. K. IWAMA, Worst-case upper bounds for kSAT, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 82 (2004), pp. 61-71.
8. V. KOLCHIN, The rate of convergence to limit distributions in the classical problem of shots, Teor. Veroyatn. Primen., 11 (1966), pp. 144-156.
9. V. KOLCHIN, A. SEVAST'YANOV, AND V. CHISTYAKOV, Random Allocations, John Wiley & Sons, New York, 1978.
10. H. RADDUM, Solving Non-linear Sparse Equation Systems over GF (2) Using Graphs, preprint, University of Bergen, Bergen, Norway, 2004.
11. H. RADDUM AND I. SEMAEV, New technique for Solving Sparse Equation Systems, Cryptology ePrint Archive, 2006/475.
12. H. RADDUM AND I. SEMAEV, Solving multiple right hand sides linear equations, Des. Codes Cryptogr., 49 (2008), pp. 147-160.
13. I. SEMAEV, On solving sparse algebraic equations over finite fields, Des. Codes Cryptogr., 49 (2008), pp. 47-60.
14. I. SEMAEV, On solving sparse algebraic equations over finite fields II. Extended abstract, in Proceedings of ACCT'08, 2008, Pamporovo, Bulgaria, Bulgarian Academy of Science, Sofia, Bulgaria, pp. 248-254.
15. E. P. K. TSANG, Foundations of Constraint Satisfaction, Academic Press, London, San Diego, CA, 1993.
16. B.-Y. YANG, J.-M. CHEN, AND N. COURTOIS, On asymptotic security estimates in XL and Gröbner bases-related algebraic cryptanalysis, in Proceedings of the 6th International Conference on Information and Communications Security (ICICS 2004), Lecture Notes in Comput. Sci. 3269, Springer-Verlag, Berlin, 2004, pp. 401-413.
17. A. D. ZAKREVSKIJ, Solution of systems of logical equations by the method of local reduction, Dokl. Nats. Akad. Nauk Belarusi, 43 (1999), pp. 5-8 (in Russian).