Computer Science – Computational Complexity
Scientific paper
2011-10-04
Computer Science
Computational Complexity
Moubariz Garaev (who has now become a co-author) has introduced some new ideas that have led to stronger results. Several impr
Scientific paper
We consider the problem of recovering a hidden element $s$ of a finite field $\F_q$ of $q$ elements from queries to an oracle that for a given $x\in \F_q$ returns $(x+s)^e$ for a given divisor $e\mid q-1$. We use some techniques from additive combinatorics and analytic number theory that lead to more efficient algorithms than the naive interpolation algorithm, for example, they use substantially fewer queries to the oracle.
Bourgain Jean
Garaev Moubariz Z.
Konyagin Sergei V.
Shparlinski Igor E.
No associations
LandOfFree
On the Hidden Shifted Power Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Hidden Shifted Power Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Hidden Shifted Power Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-270238