Usuario: guest
No has iniciado sesión
No has iniciado sesión
Type: Article
On the hidden shifted power problem
Abstract:
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 is an element of F-q returns (x + s)(e) for a given divisor e vertical bar 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.
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 is an element of F-q returns (x + s)(e) for a given divisor e vertical bar 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.
Keywords: Hidden shifted power problem; black-box interpolation; character sums
MSC: 11T06 (11Y16 68Q25 94A60)
Journal: SIAM Journal on Computing
ISSN: 0097-5397
Year: 2012
Volume: 41
Number: 6
Pages: 1524-1557



Autores Institucionales Asociados a la Referencia: