194 search results - page 2 / 39 » Better polynomials for GNFS |
143
click to vote
IWOCA
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
186
click to vote
FSE
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
185
Voted
ASAP
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
158
Voted
ICALP
2009
Springer
16 years 27 days ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
184
Voted
ASIACRYPT
2007
Springer
16 years 8 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...