78 search results - page 4 / 16 » Unsatisfiable Systems of Equations, Over a Finite Field |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
EUROCRYPT
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
3DPVT
2004
IEEE
13 years 11 months ago
2004
IEEE
Computer graphics cameras lack the finite Depth of Field (DOF) present in real world ones. This results in all objects being rendered sharp regardless of their depth, reducing the...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
TIT
2008
13 years 7 months ago
2008
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...