19 search results - page 1 / 4 » Efficient Algorithms for Solving Overdefined Systems of Mult... |
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...
FSE
2006
Springer
13 years 8 months ago
2006
Springer
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
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...
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...