### Private Area

There are no translations available.

#### On the hidden shifted power problem

(joint work of Jean Bourgain, Moubariz Garaev and Sergei Konyagin)

Igor Shparlinski, Macquarie University

10 de febrero, 2012, 12:00 h., Sala Naranja ICMAT (cartel).

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|q-1$. This question is motivated by some applications to pairing based cryptography. Using Largange interpolation one can recover s in time $ep^{o(1)}$ on a classical computer. In the case of $e = (q - 1)/2$ an efficient quantum algorithm has been given by W. van Dam, S. Hallgren and L. Ip. We describe some techniques from additive combinatorics and analytic number theory that lead to more efficient classical algorithms than the naive interpolation algorithm, for example, they use substantially fewer queries to the oracle. We formulate some questions and discuss whether quantum algorithms can give further improvement.

Volver
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 7}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8157467842102051, "perplexity_flag": "middle"}