105 search results - page 5 / 21 » On the subset sum problem over finite fields |
INDOCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
CDC
2009
IEEE
14 years 3 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...
ASIACRYPT
2000
Springer
13 years 11 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
FFA
2008
13 years 7 months ago
2008
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...