223 search results - page 23 / 45 » Multivariates Polynomials for Hashing |
116
click to vote
PDCAT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
131
click to vote
ISSAC
1995
Springer
15 years 7 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
122
click to vote
JSC
2010
15 years 1 months ago
2010
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
129
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
170
click to vote
PKC
2011
Springer
14 years 6 months ago
2011
Springer
We investigate the security of a generalization of HFE (multivariate and odd-characteristic variants). First, we propose an improved version of the basic Kipnis-Shamir key recovery...