Abstract
We consider the problem of determining a rational function f over a finite field script F signp of p elements given a noisy black box B, which for each t ∈ script F signp returns several most significant bits of the residue of f(t) modulo the prime p.
Original language | English |
---|---|
Pages (from-to) | 420-429 |
Number of pages | 10 |
Journal | Lecture Notes in Computer Science |
Volume | 3595 |
Publication status | Published - 2005 |