1. D. Boneh and R. Venkatesan, Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129–142.
2. D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, Proc. 8-rd Annual ACM-SIAM Symp. on Discr. Algorithms, ACM, NY, 1997, 675–681.
3. A. E. Brouwer, R. Pellikan, and E. R. Verheul, Doing more with fewer bits, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1716 (1999), 321–332.
4. M. I. Gonzalez Vasco and M. Näslund, A survey of hard core functions, Proceedings of the Workshop on Comp. Number Theory and Cryptography, Birkhauser, 2000.
5. M. I. González Vasco and I. E. Shparlinski, Security of the most significant bits of the Shamir message passing scheme, Math. Comp., (to appear).