363 search results - page 2 / 73 » Finding Small Solutions to Small Degree Polynomials |
TCS
2008
13 years 5 months ago
2008
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
COCO
2008
Springer
13 years 7 months ago
2008
Springer
We prove that the sum of d small-bias generators L : Fs Fn fools degree-d polynomials in n variables over a field F, for any fixed degree d and field F, including F = F2 = {0, 1}...
MOC
1998
13 years 5 months ago
1998
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
EUROCRYPT
2004
Springer
13 years 10 months 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...