The Multivariate Hidden Number Problem


This work extends the line of research on the hidden number problem. Motivated by studying bit security in finite fields, we define the multivariate hidden number problem. Here, the secret and the multiplier are vectors, and partial information about their dot product is given. Using tools from discrete Fourier analysis introduced by Akavia, Goldwasser and Safra, we show that if one can find the significant Fourier coefficients of some function, then one can solve the multivariate hidden number problem for that function. This allows us to generalise the work of Akavia on the hidden number problem with (non-adaptive) chosen multipliers to all finite fields. We give two further applications of our results, both of which generalise previous works to all (finite) extension fields. The first considers the general (random samples) hidden number problem in Fpm and assumes an advice is given to the algorithm. The second considers a model that allows changing representations, where we show hardness of individual bits for elliptic curve and pairing based functions for elliptic curves over extension fields, as well as hardness of any bit of any component of the Diffie-Hellman secret in Fpm (m > 1).

DOI: 10.1007/978-3-319-17470-9_15

Extracted Key Phrases

Cite this paper

@article{Galbraith2015TheMH, title={The Multivariate Hidden Number Problem}, author={Steven D. Galbraith and Barak Shani}, journal={IACR Cryptology ePrint Archive}, year={2015}, volume={2015}, pages={111} }