W. D. Banks, F. Griffin, D. Lieman, and I. Shparlinski, Non-linear complexity of the Naor-Reingold pseudo-random function, ICISC 99: 2nd International Conference on Information Security and Cryptology, vol.1787, pp.53-59, 2000.

I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic curves in cryptography, 1999.

E. Bresson, O. Chevassut, and D. Pointcheval, The group Diffie-Hellman problems, SAC 2002: 9th Annual International Workshop on Selected Areas in Cryptography, vol.2595, pp.325-338

. Springer, , 2003.

D. Coppersmith and I. Shparlinski, On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping, Journal of Cryptology, vol.13, issue.3, pp.339-360, 2000.

M. Cruz, D. Gómez, and D. Sadornil, On the linear complexity of the Naor-Reingold sequence with elliptic curves, Finite Fields Appl, vol.16, issue.5, pp.329-333, 2010.

J. G. Domingo-gmez and . Lvar-ibeasi, On the linear complexity of the Naor-Reingold pseudorandom function, Inf. Process. Lett, vol.111, pp.854-856, 2011.

E. El-mahassni and I. Shparlinski, Polynomial representations of the Diffie-Hellman mapping, Bull. Aust. Math. Soc, vol.63, issue.3, pp.467-473, 2001.

F. Griffin and . Shparlinski, On the linear complexity of the Naor-Reingold pseudo-random number generator, Proc. 2nd Intern. Conf. on Information and Communication Security, ICICS1999, Sydney, vol.1726, 1999.

E. Kiltz and A. Winterhof, On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping, Bull. Aust. Math. Soc, vol.69, issue.2, pp.305-315, 2004.

E. Kiltz and A. Winterhof, Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem, Discrete Appl. Math, vol.154, issue.2, pp.326-336, 2006.

T. Lange and A. Winterhof, Polynomial interpolation of the elliptic curve and XTR discrete logarithm, p.8

, Proceedings, Annual International Conference, vol.2387, pp.137-143, 2002.

T. Lange and A. Winterhof, Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q ? 1, Discrete Appl. Math, vol.128, issue.1, pp.193-206, 2003.

T. Lange and A. Winterhof, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 15th International Symposium, AAECC-15, vol.2643, pp.51-60, 2003.

S. Ling, I. E. Shparlinski, and H. Wang, On the multidimensional distribution of the Naor-Reingold pseudo-random function, Math. Comput, vol.83, issue.289, 2014.

G. C. Meletiou and A. Winterhof, Interpolation of the double discrete logarithm, Arithmetic of Finite Fields, 2nd International Workshop, vol.5130, pp.1-10, 2008.

M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, 38th Annual Symposium on Foundations of Computer Science, pp.458-467, 1997.

M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, J. ACM, vol.51, issue.2, pp.231-262, 2004.

I. E. Shparlinski, Linear complexity of the Naor-Reingold pseudo-random function, Inf. Process. Lett, vol.76, issue.3, pp.95-99, 2000.

I. E. Shparlinski, On the Naor-Reingold pseudo-random function from elliptic curves, Appl. Algebra Eng. Commun. Comput, vol.11, issue.1, pp.27-34, 2000.

I. E. Shparlinski and J. H. Silverman, On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves, Des. Codes Cryptography, vol.24, issue.3, pp.279-289, 2001.

L. C. Washington, Elliptic curves. Number theory and cryptography, 2008.

A. Winterhof, A note on the interpolation of the Diffie-Hellman mapping, Bull. Aust. Math. Soc, vol.64, issue.3, pp.475-477, 2001.