1. Bauer A., Vergnaud D., Zapalowicz J.-C.: Inferring sequences produced by nonlinear pseudorandom number generators using coppersmith’s methods. In: Proceedings of the Public Key Cryptography—PKC 2012—15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21–23, 2012, pp. 609–626 (2012).
2. Blake I.F., Garefalakis T., Shparlinski I.E.: On the bit security of the Diffie–Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6), 397–404 (2006).
3. Boneh D.: The decision Diffie–Hellman problem. In: Proceedings of the Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21–25, 1998, pp. 48–63 (1998).
4. Boneh D., Halevi S., Howgrave-Graham N.: The modular inversion hidden number problem. In: ASIACRYPT 2001, pp. 36–51. Springer, Berlin (2001).
5. Boneh D., Venkatesan R.: Hardness of computing the most significant bits of secret keys in Diffie–Hellman and related schemes. In: CRYPTO 1996, pp. 129–142. Springer, Berlin (1996).