期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2000
卷号：2000
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：Boneh and Venkatesan have recently proposed a polynomial time
algorithm for recovering a ``hidden'' element of a
finite field \Fp of p elements from rather short
strings of the most significant bits of the remainder
mo\-du\-lo p of t for several values of t selected uniformly
at random from \Fp. Unfortunately the applications to the
computational security of most significant bits
of private keys of some finite field exponentiation based cryptosystems
given by Boneh and Venkatesan are not quite correct. For the Diffie-Hellman
cryptosystem the
result of Boneh and Venkatesan has been corrected and
generalized in our recent paper by Gonz{\'a}lez Vasco and Shparlinski.
Here a similar analysis is given for the Shamir message passing scheme.
The results depend on some bounds
of exponential sums.
关键词：cryptography, exponential sums, hidden number problem, Shamir message passing scheme
