A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Rounding in lattices and its cryptographic applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Lattice Reduction in Cryptology: An Update
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We are given an unknown polynomial f ∈ ℤ[x] by a black box which on input a ∈ ℤ returns a value rq · f(a) for some unknown nonzero rational numbers ra. If we have appropriate upper bounds on the numerator and denominator of ra and the degree of f, then the coefficients of f can be computed in probabilistic polynomial time.