On the Hidden Shifted Power Problem

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-270238

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.