21 search results - page 1 / 5 » Asymptotic Acceleration of Solving Multivariate Polynomial S... |
STOC
1998
ACM
13 years 9 months ago
1998
ACM
EUROCRYPT
2000
Springer
13 years 8 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...
JC
2000
13 years 4 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
IMA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
CSJM
2008
13 years 5 months ago
2008
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon general...