On solving sparse algebraic equations over finite fields

Designs, Codes, and Cryptography

Volumn 49, Issue 1-3, 2008, Pages 47-60

  Semaev, Igor ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Constraint satisfaction problem; Gluing; Random allocations; Sparse algebraic equations over finite fields

Indexed keywords

CRYPTOGRAPHY;

CONSTRAINT SATISFACTION PROBLEM; FINITE FIELDS; GLUING; RANDOM ALLOCATIONS; SPARSE ALGEBRAIC EQUATIONS OVER FINITE FIELDS;

MATRIX ALGEBRA;

EID: 51349154683     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-008-9182-x     Document Type: Article

References (14)

1. Bardet M., Faugére J.-C., Salvy B.: Complexity of Gröbner basis computation for semiregular overdetermined sequences over F2 with solutions in F2. Research report RR-5049, INRIA (2003).
2. Balakin G.V., Bachurin S.A.: Evaluation of the successive search for unknowns, (in Russian), Trudy po diskretnoj matematike, vol. 6, pp. 7-13. Fizmatlit (2002).
3. Courtois N., Klimov A., Patarin J., Shamir A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Eurocrypt 2000, LNCS 1807, pp. 392-407. Springer-Verlag (2000).
4. Chistyakov V.P. (1967). Discrete limit distributions in the problem of shots with arbitrary probabilities of occupancy of boxes. Matem. Zametki 1: 9-16
5. Faugére J.-C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: Proc. ISSAC 2002, pp. 75-83. ACM Press (2002).
6. Iwama K. (2004). Worst-case upper bounds for kSAT. Bull. EATCS 82: 61-71
7. Kolchin V. (1966). The rate of convergence to limit distributions in the classical problem of shots. Teoriya veroyatn. i yeye primenen. 11: 144-156
8. Kolchin V., Sevast'yanov A., Chistyakov V.: Random Allocations. Wiley (1978).
9. Raddum H.: Solving non-linear sparse equation systems over GF(2) using graphs. University of Bergen, preprint, 2004.
10. Raddum H., Semaev I.: New technique for solving sparse equation systems. Cryptology ePrint Archive, 2006/475.
11. Raddum H., Semaev I.: Solving MRHS linear equations. Extended abstract, accepted at WCC (2007).
12. Tsang E.P.K.: Foundations of Constraint Satisfaction. Academic Press (1993).
13. Yang B.-Y., Chen J.-M., Courtois N.: On asymptotic security estimates in XL and Gröbner bases-related algebraic cryptanalysis. In: ICICS 2004, LNCS 3269, pp. 401-413. Springer-Verlag (2004).
14. Zakrevskij A., Vasilkova I.: Reducing large systems of Boolean equations. In: 4th International Workshop on Boolean Problems, Freiberg University, September, 21-22 (2000).