313 search results - page 4 / 63 » Solving Structured Polynomial Systems and Applications to Cr... |
EUROCRYPT
2004
Springer
14 years 25 days ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
IMA
2009
Springer
14 years 2 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...
EUROCRYPT
2005
Springer
14 years 29 days ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
CANS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we present an efficient attack on the multivariate Quadratic Quasigroups (MQQ) public key cryptosystem. Our cryptanalysis breaks the MQQ cryptosystem by so...
CADE
2008
Springer
13 years 9 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...