105 search results - page 10 / 21 » On the subset sum problem over finite fields |
COMBINATORICA
2008
13 years 7 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
AI
1998
Springer
13 years 7 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
ALGORITHMICA
2006
13 years 7 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...