Local randomness in polynomial random number and random function generators
SIAM Journal on Computing
Finite fields
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines
Theoretical Computer Science
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum algorithms for some hidden shift problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
The Modular Inversion Hidden Number Problem
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An improved quantum Fourier transform algorithm and applications
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation
Classical and Quantum Computation
Classical and quantum function reconstruction via character evaluation
Journal of Complexity - Special issue on coding and cryptography
Noisy interpolation of sparse polynomials in finite fields
Applicable Algebra in Engineering, Communication and Computing
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum period reconstruction of approximate sequences
Information Processing Letters
Efficient quantum algorithm for identifying hidden polynomials
Quantum Information & Computation
| Hi-index | 0.01 |
We consider the problem of determining a rational function f over a finite field $\mathbb{F}_p$ of p elements given a noisy black box ${\mathcal B}$, which for each $t \in \mathbb{F}_p$ returns several most significant bits of the residue of f(t) modulo the prime p.