Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation

@article{HowgraveGraham2003HiddenNP,
  title={Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation},
  author={Nick Howgrave-Graham and Phong Q. Nguyen and Igor E. Shparlinski},
  journal={Math. Comput.},
  year={2003},
  volume={72},
  pages={1473-1485}
}
We consider a generalisation of the hidden number problem recently introduced by Boneh and Venkatesan. The initial problem can be stated as follows: recover a number a ∈ Fp such that for many known random t ∈ Fp approximations to the values of batcp are known. Here we study a version of the problem where the “multipliers” t are not known but rather certain approximations to them are given. We present a probabilistic polynomial time solution when the error is small enough, and we show that the… CONTINUE READING