On the Complexity of Solving Quadratic Boolean Systems

Details On the Complexity of Solving Quadratic Boolean Systems On the Complexity of Solving Quadratic Boolean Systems

2011-12-29

arxiv.org/abs/1112.6263v1

Computer Science

Symbolic Computation

Scientific paper

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity bound was reached by an exhaustive search in $4\log_2 n\,2^n$ operations. We give an algorithm that reduces the problem to a combination of exhaustive search and sparse linear algebra. This algorithm has several variants depending on the method used for the linear algebra step. Under precise algebraic assumptions, we show that the deterministic variant of our algorithm has complexity bounded by $O(2^{0.841n})$ when $m=n$, while a probabilistic variant of the Las Vegas type has expected complexity $O(2^{0.792n})$. Experiments on random systems show that the algebraic assumptions are satisfied with probability very close to~1. We also give a rough estimate for the actual threshold between our method and exhaustive search, which is as low as~200, and thus very relevant for cryptographic applications.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Solving Quadratic Boolean Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of Solving Quadratic Boolean Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Solving Quadratic Boolean Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728402