8 search results - page 2 / 2 » On the complexity of factoring bivariate supersparse (Lacuna... |
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
COMPGEOM
1989
ACM
13 years 9 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...