{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:08Z","timestamp":1740122528069,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ROMAnTIC"],"award-info":[{"award-number":["ROMAnTIC"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10623-018-0486-1","type":"journal-article","created":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T06:18:47Z","timestamp":1525241927000},"page":"75-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial interpolation of the generalized Diffie\u2013Hellman and Naor\u2013Reingold functions"],"prefix":"10.1007","volume":"87","author":[{"given":"Thierry","family":"Mefenza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2113-3967","authenticated-orcid":false,"given":"Damien","family":"Vergnaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,2]]},"reference":[{"issue":"6","key":"486_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W., Hellman M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976).","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Boneh, D.: The decision Diffie\u2013Hellman problem. In: Buhler, J. (ed.) Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21\u201325, 1998. Lecture Notes in Computer Science, Vol. 1423, pp. 48\u201363. Springer (1998).","key":"486_CR2"},{"unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th Annual Symposium on Foundations of Computer Science, pp. 458\u2013467. IEEE Computer Society Press, Miami Beach, Florida (1997).","key":"486_CR3"},{"issue":"2","key":"486_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"Naor M., Reingold O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004).","journal-title":"J. ACM"},{"issue":"4","key":"486_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux A.: A one round protocol for tripartite Diffie\u2013Hellman. J. Cryptol. 17(4), 263\u2013276 (2004).","journal-title":"J. Cryptol."},{"issue":"1","key":"486_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s00145-015-9220-6","volume":"30","author":"A Escala","year":"2017","unstructured":"Escala A., Herold G., Kiltz E., R\u00e0fols C., Villar J.L.: An algebraic framework for Diffie\u2013Hellman assumptions. J. Cryptol. 30(1), 242\u2013288 (2017).","journal-title":"J. Cryptol."},{"issue":"3","key":"486_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1266977.1266979","volume":"10","author":"E Bresson","year":"2007","unstructured":"Bresson E., Chevassut O., Pointcheval D.: Provably secure authenticated group Diffie\u2013Hellman key exchange. ACM Trans. Inf. Syst. Secur. 10(3), 10 (2007).","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"486_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0004972700019547","volume":"63","author":"EE Mahassni","year":"2001","unstructured":"Mahassni E.E., Shparlinski I.: Polynomial representations of the Diffie\u2013Hellman mapping. Bull. Aust. Math. Soc. 63, 467\u2013473 (2001).","journal-title":"Bull. Aust. Math. Soc."},{"issue":"3","key":"486_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0004972700019936","volume":"64","author":"A Winterhof","year":"2001","unstructured":"Winterhof A.: A note on the interpolation of the Diffie\u2013Hellman mapping. Bull. Austral. Math. Soc. 64(3), 475\u2013477 (2001).","journal-title":"Bull. Austral. Math. Soc."},{"key":"486_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S0004972700036042","volume":"69","author":"E Kiltz","year":"2004","unstructured":"Kiltz E., Winterhof A.: On the interpolation of bivariate polynomials related to Diffie\u2013Hellman mapping. Bull. Aust. Math. Soc. 69, 305\u2013315 (2004).","journal-title":"Bull. Aust. Math. Soc."},{"key":"486_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8037-4","volume-title":"Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness","author":"I Shparlinski","year":"2003","unstructured":"Shparlinski I.: Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness. Birkhauser Verlag, Basel (2003)."},{"issue":"289","key":"486_CR12","doi-asserted-by":"publisher","first-page":"2429","DOI":"10.1090\/S0025-5718-2014-02794-4","volume":"83","author":"S Ling","year":"2014","unstructured":"Ling S., Shparlinski I.E., Wang H.: On the multidimensional distribution of the Naor\u2013Reingold pseudo-random function. Math. Comput. 83(289), 2429\u20132434 (2014).","journal-title":"Math. Comput."},{"issue":"1","key":"486_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s002000000023","volume":"11","author":"IE Shparlinski","year":"2000","unstructured":"Shparlinski I.E.: On the Naor\u2013Reingold pseudo-random function from elliptic curves. Appl. Algebra Eng. Commun. Comput. 11(1), 27\u201334 (2000).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"5","key":"486_CR14","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ipl.2008.05.025","volume":"108","author":"\u00c0 Ibeas","year":"2008","unstructured":"Ibeas \u00c0.: On the period of the Naor\u2013Reingold sequence. Inf. Process. Lett. 108(5), 304\u2013307 (2008).","journal-title":"Inf. Process. Lett."},{"issue":"17","key":"486_CR15","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.ipl.2011.05.017","volume":"111","author":"D G\u00f3mez","year":"2011","unstructured":"G\u00f3mez D., Gutierrez J., Ibeas A.: On the linear complexity of the Naor\u2013Reingold sequence. Inf. Process. Lett. 111(17), 854\u2013856 (2011).","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"486_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0020-0190(00)00133-2","volume":"76","author":"IE Shparlinski","year":"2000","unstructured":"Shparlinski I.E.: Linear complexity of the Naor\u2013Reingold pseudo-random function. Inf. Process. Lett. 76(3), 95\u201399 (2000).","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"486_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1011223204345","volume":"24","author":"IE Shparlinski","year":"2001","unstructured":"Shparlinski I.E., Silverman J.H.: On the linear complexity of the Naor\u2013Reingold pseudo-random function from elliptic curves. Des. Codes Cryptogr. 24(3), 279\u2013289 (2001).","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"486_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.ffa.2010.05.005","volume":"16","author":"M Cruz","year":"2010","unstructured":"Cruz M., G\u00f3mez D., Sadornil D.: On the linear complexity of the Naor\u2013Reingold sequence with elliptic curves. Finite Fields Appl. 16(5), 329\u2013333 (2010).","journal-title":"Finite Fields Appl."},{"key":"486_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/10719994_5","volume-title":"ICISC 99: 2nd International Conference on Information Security and Cryptology","author":"WD Banks","year":"2000","unstructured":"Banks W.D., Griffin F., Lieman D., Shparlinski I.: Non-linear complexity of the Naor\u2013Reingold pseudo-random function. In: Song J. (ed.) ICISC 99: 2nd International Conference on Information Security and Cryptology, vol. 1787, pp. 53\u201359. Lecture Notes in Computer ScienceSpringer, Heidelberg, Germany, Seoul, Korea (2000)."},{"key":"486_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00200-016-0309-4","volume":"28","author":"T Mefenza","year":"2017","unstructured":"Mefenza T., Vergnaud D.: Polynomial interpolation of the Naor\u2013Reingold pseudo-random function. Appl. Algebra Eng. Commun. Comput. 28, 237\u2013255 (2017).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"486_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s001450010002","volume":"13","author":"D Coppersmith","year":"2000","unstructured":"Coppersmith D., Shparlinski I.: On polynomial approximation of the discrete logarithm and the Diffie\u2013Hellman mapping. J. Cryptol. 13(3), 339\u2013360 (2000).","journal-title":"J. Cryptol."},{"issue":"2","key":"486_CR22","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.dam.2005.03.030","volume":"154","author":"E Kiltz","year":"2006","unstructured":"Kiltz E., Winterhof A.: Polynomial interpolation of cryptographic functions related to Diffie\u2013Hellman and discrete logarithm problem. Discret. Appl. Math. 154(2), 326\u2013336 (2006).","journal-title":"Discret. Appl. Math."},{"unstructured":"Lange, T., Winterhof, A.: Polynomial interpolation of the elliptic curve and XTR discrete logarithm. In: Ibarra, O.H., Zhang, L. (eds.) Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15\u201317, 2002. Lecture Notes in Computer Science, Vol. 2387, pp. 137\u2013143. Springer (2002).","key":"486_CR23"},{"issue":"1","key":"486_CR24","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0166-218X(02)00445-6","volume":"128","author":"T Lange","year":"2003","unstructured":"Lange T., Winterhof A.: Interpolation of the discrete logarithm in \n                    \n                      \n                    \n                    $$\\mathbb{F}_{q}$$\n                    \n                      \n                        \n                          F\n                          q\n                        \n                      \n                    \n                   by Boolean functions and by polynomials in several variables modulo a divisor of \n                    \n                      \n                    \n                    $$q-1$$\n                    \n                      \n                        \n                          q\n                          -\n                          1\n                        \n                      \n                    \n                  . Discret. Appl. Math. 128(1), 193\u2013206 (2003).","journal-title":"Discret. Appl. Math."},{"unstructured":"Meletiou, G.C., Winterhof, A.: Interpolation of the double discrete logarithm. In: von\u00a0zur Gathen, J. Ima\u00f1a, J.L., Ko\u00e7, \u00c7.K. (eds.) Arithmetic of Finite Fields, 2nd International Workshop, WAIFI 2008, Siena, Italy, July 6\u20139, 2008. Lecture Notes in Computer Science, Vol. 5130, pp. 1\u201310. Springer (2008).","key":"486_CR25"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0486-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0486-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0486-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:39:53Z","timestamp":1556739593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0486-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["486"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0486-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,5,2]]},"assertion":[{"value":"29 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}