78 search results - page 3 / 16 » Unsatisfiable Systems of Equations, Over a Finite Field |
MOC
1998
13 years 7 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
ISDA
2006
IEEE
14 years 1 months ago
2006
IEEE
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
CDC
2009
IEEE
14 years 5 days ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
AAECC
1993
Springer
13 years 11 months ago
1993
Springer
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...