223 search results - page 7 / 45 » Multivariates Polynomials for Hashing |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
EUROCRYPT
2000
Springer
13 years 10 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
ISSAC
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
ESA
2008
Springer
13 years 8 months ago
2008
Springer
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...