W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Trans. Information Theory, vol.22, issue.6, pp.644-654, 1976.

D. Boneh, The decision Diffie-Hellman problem, Algorithmic Number Theory, Third International Symposium, vol.1423, pp.48-63, 1998.

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.

A. Joux, A one round protocol for tripartite Diffie-Hellman, Journal of Cryptology, vol.17, issue.4, pp.263-276, 2004.

A. Escala, G. Herold, E. Kiltz, C. Ràfols, and J. L. Villar, An algebraic framework for Diffie-Hellman assumptions, Journal of Cryptology, vol.30, issue.1, pp.242-288, 2017.

E. Bresson, O. Chevassut, and D. , Provably secure authenticated group diffiehellman key exchange, ACM Trans. Inf. Syst. Secur, vol.10, issue.3, p.10, 2007.

E. E. Mahassni and I. Shparlinski, Polynomial representations of the Diffie-Hellman mapping, vol.63, pp.467-473, 2001.

A. Winterhof, A note on the interpolation of the Diffie-Hellman mapping, Bull. Austral. Math. Soc

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

I. Shparlinski, Cryptographic applications of analytic number theory. Complexity lower bounds and pseudorandomness, 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

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.

À. Ibeas, On the period of the Naor-Reingold sequence, Information Processing Letters, vol.108, issue.5, pp.304-307, 2008.

D. Gómez, J. Gutierrez, and A. Ibeas, On the linear complexity of the Naor-Reingold sequence, Inf. Process. Lett, vol.111, issue.17, pp.854-856, 2011.

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 and J. H. Silverman, On the linear complexity of the Naor-Reingold pseudorandom function from elliptic curves, Des. Codes Cryptography, vol.24, issue.3, pp.279-289, 2001.

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.

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.

T. Mefenza and D. Vergnaud, Polynomial interpolation of the Naor-Reingold pseudo-random function, Applicable Algebra in Engineering, Communication and Computing, vol.28, pp.237-255, 2017.

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.

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, 8th 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.

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.