1. D. Boneh, R. Venkatesan, Hardness of computing the most significant bits of secret keys in Diffie–Hellman and related schemes, Proceedings Crypto’96, Lecture Notes in Computer Science, Vol. 1109, Springer, Berlin, 1996, pp. 129–142.
2. A.E. Brouwer, R. Pellikaan, E.R. Verheul, Doing more with fewer bits, Proceedings Asiacrypt’99, Lecture Notes in Computer Science, Vol. 1716, Springer, Berlin, 1999, pp. 321–332.
3. On the statistical properties of Diffie–Hellman distributions;Canetti;Israel J. Math.,2000
4. On correlation of binary M-sequences;Friedlander;Designs, Codes Cryptography,1999
5. M.I. González Vasco, M. Näslund, A survey of hard core functions, Proceedings of the Workshop on Cryptography and Computational Number Theory, Singapore, 1999, Birkhäuser, Basel, 2001, pp. 227–256.