{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:02:35Z","timestamp":1725472955345},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354819"},{"type":"electronic","value":"9783540354826"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779360_12","type":"book-chapter","created":{"date-parts":[[2006,11,16]],"date-time":"2006-11-16T08:17:10Z","timestamp":1163665030000},"page":"144-154","source":"Crossref","is-referenced-by-count":4,"title":["Interpolation of Functions Related to the Integer Factoring Problem"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Adelmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Bach, E.: Discrete logarithms and factoring, Report No. UCB\/CSD-84-186, Computer Science Division (EECS), University of California, Berkeley, California (1984)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11779360_11","volume-title":"Coding and Cryptography","author":"N. Brandst\u00e4tter","year":"2006","unstructured":"Brandst\u00e4tter, N., Lange, T., Winterhof, A.: On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 135\u2013143. Springer, Heidelberg (2006)"},{"key":"12_CR3","unstructured":"Brandst\u00e4tter, N., Winterhof, A.: Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials. Arch. Math. (Brno) (to appear)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"3654","DOI":"10.1109\/TIT.2005.855615","volume":"51","author":"N. Brandst\u00e4tter","year":"2005","unstructured":"Brandst\u00e4tter, N., Winterhof, A.: Some notes on the two-prime generator. IEEE Trans. Inform. Theory\u00a051, 3654\u20133657 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"12_CR5","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices Amer. Math. Soc.\u00a046, 203\u2013213 (1999)","journal-title":"Notices Amer. Math. Soc."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Venkatesan, R.: Breaking RSA may not be equivalent to factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 59\u201371. Springer, Heidelberg (1998)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"12_CR8","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-Hellman mapping. J. Cryptology\u00a013, 339\u2013360 (2000)","journal-title":"J. Cryptology"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/ffta.1997.0181","volume":"3","author":"C. Ding","year":"1997","unstructured":"Ding, C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl.\u00a03, 159\u2013174 (1997)","journal-title":"Finite Fields Appl."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0020-0190(98)00025-8","volume":"66","author":"C. Ding","year":"1998","unstructured":"Ding, C., Helleseth, T.: On cyclotomic generator of order r. Inform. Process. Lett.\u00a066, 21\u201325 (1998)","journal-title":"Inform. Process. Lett."},{"key":"12_CR11","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, New York (1999)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"2159","DOI":"10.1109\/18.868485","volume":"46","author":"F. Griffin","year":"2000","unstructured":"Griffin, F., Shparlinski, I.: On the linear complexity profile of the power generator. IEEE Trans. Inform. Theory\u00a046, 2159\u20132162 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. Hastad","year":"1988","unstructured":"Hastad, J.: Solving simultaneous modular equations of low degree. SIAM J. Comput.\u00a017, 336\u2013341 (1988)","journal-title":"SIAM J. Comput."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S0004972700036042","volume":"69","author":"E. Kiltz","year":"2004","unstructured":"Kiltz, E., Winterhof, A.: Lower bounds on weight and degree of bivariate polynomials related to the Diffie-Hellman mapping. Bull. Austral. Math. Soc.\u00a069, 305\u2013315 (2004)","journal-title":"Bull. Austral. Math. Soc."},{"key":"12_CR15","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-Hellman and discrete logarithm problem. Discrete Appl. Math.\u00a0154, 326\u2013336 (2006)","journal-title":"Discrete Appl. Math."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1022584306676","volume":"28","author":"S. Konyagin","year":"2003","unstructured":"Konyagin, S., Lange, T., Shparlinski, I.: Linear complexity of the discrete logarithm. Des. Codes Cryptogr.\u00a028, 135\u2013146 (2003)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45655-4_16","volume-title":"Computing and Combinatorics","author":"T. Lange","year":"2002","unstructured":"Lange, T., Winterhof, A.: Polynomial interpolation of the elliptic curve and XTR discrete logarithm. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 137\u2013143. Springer, Heidelberg (2002)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.4064\/aa101-3-3","volume":"101","author":"T. Lange","year":"2002","unstructured":"Lange, T., Winterhof, A.: Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions. Acta Arith.\u00a0101, 223\u2013229 (2002)","journal-title":"Acta Arith."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Lange, T., Winterhof, A.: Interpolation of the discrete logarithm in $ F\\sb q$ by Boolean functions and by polynomials in several variables modulo a divisor of q\u2009\u2212\u20091. In: International Workshop on Coding and Cryptography (WCC 2001) (Paris) Discrete Appl. Math. 128, 193\u2013206 (2003)","DOI":"10.1016\/S0166-218X(02)00445-6"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44828-4_7","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"T. Lange","year":"2003","unstructured":"Lange, T., Winterhof, A.: Interpolation of the elliptic curve Diffie-Hellman mapping. In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol.\u00a02643, pp. 51\u201360. Springer, Heidelberg (2003)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0004972700019547","volume":"63","author":"E. Mahassni El","year":"2001","unstructured":"El Mahassni, E., Shparlinski, I.: Polynomial representations of the Diffie-Hellman mapping. Bull. Austral. Math. Soc.\u00a063, 467\u2013473 (2001)","journal-title":"Bull. Austral. Math. Soc."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1109\/18.959261","volume":"47","author":"W. Meidl","year":"2001","unstructured":"Meidl, W., Winterhof, A.: Lower bounds on the linear complexity of the discrete logarithm in finite fields. IEEE Trans. Inform. Theory\u00a047, 2807\u20132811 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00200-002-0104-2","volume":"13","author":"W. Meidl","year":"2002","unstructured":"Meidl, W., Winterhof, A.: A polynomial representation of the Diffie-Hellman mapping. Appl. Algebra Engrg. Comm. Comput.\u00a013, 313\u2013318 (2002)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"12_CR24","first-page":"25","volume":"29","author":"G.C. Meletiou","year":"1993","unstructured":"Meletiou, G.C.: Explicit form for the discrete logarithm over the field GF(p,k). Arch. Math. (Brno)\u00a029, 25\u201328 (1993)","journal-title":"Arch. Math. (Brno)"},{"issue":"45","key":"12_CR25","first-page":"1","volume":"41","author":"G.C. Meletiou","year":"1995","unstructured":"Meletiou, G.C.: Explicit form for the discrete logarithm over the field GF(p,k). Bul. Inst. Politeh. Ia\u015fi. Sec\u0163. I. Mat. Mec. Teor. Fiz.\u00a041(45), 1\u20134 (1995)","journal-title":"Bul. Inst. Politeh. Ia\u015fi. Sec\u0163. I. Mat. Mec. Teor. Fiz."},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01189026","volume":"3","author":"G. Meletiou","year":"1992","unstructured":"Meletiou, G., Mullen, G.L.: A note on discrete logarithms in finite fields. Appl. Algebra Engrg. Comm. Comput.\u00a03, 75\u201378 (1992)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"12_CR27","series-title":"CRC Press Series on Discrete Mathematics and its Applications","volume-title":"Handbook of applied cryptography. With a foreword by Ronald L. Rivest","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. With a foreword by Ronald L. Rivest. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1997)"},{"key":"12_CR28","first-page":"71","volume":"16","author":"W.B. M\u00fcller","year":"1981","unstructured":"M\u00fcller, W.B., N\u00f6bauer, W.: Some remarks on public-key cryptosystems. Studia Sci. Math. Hungar.\u00a016, 71\u201376 (1981)","journal-title":"Studia Sci. Math. Hungar."},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-39805-8_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201985","author":"W.B. M\u00fcller","year":"1986","unstructured":"M\u00fcller, W.B., N\u00f6bauer, R.: Cryptanalysis of the dickson-scheme. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol.\u00a0219, pp. 50\u201361. Springer, Heidelberg (1986)"},{"key":"12_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.4064\/aa-47-3-255-261","volume":"47","author":"G.L. Mullen","year":"1986","unstructured":"Mullen, G.L., White, D.: A polynomial representation for logarithms in GF(q). Acta Arith.\u00a047, 255\u2013261 (1986)","journal-title":"Acta Arith."},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01810847","volume":"1","author":"H. Niederreiter","year":"1990","unstructured":"Niederreiter, H.: A short proof for explicit formulas for discrete logarithms in finite fields. Appl. Algebra Engrg. Comm. Comput.\u00a01, 55\u201357 (1990)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/ffta.2001.0334","volume":"8","author":"H. Niederreiter","year":"2002","unstructured":"Niederreiter, H., Winterhof, A.: Incomplete character sums and polynomial interpolation of the discrete logarithm. Finite Fields Appl.\u00a08, 184\u2013192 (2002)","journal-title":"Finite Fields Appl."},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1216\/RMJ-1984-14-4-851","volume":"14","author":"J.-J. Risler","year":"1984","unstructured":"Risler, J.-J.: Hovansky\u2019s theorem and complexity theory. Ordered fields and real algebraic geometry (Boulder, Colo. 1983). Rocky Mountain J. Math.\u00a014, 851\u2013853 (1984)","journal-title":"Rocky Mountain J. Math."},{"key":"12_CR34","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0214014","volume":"14","author":"J.-J. Risler","year":"1985","unstructured":"Risler, J.-J.: Additive complexity and zeros of real polynomials. SIAM J. Comput.\u00a014, 178\u2013183 (1985)","journal-title":"SIAM J. Comput."},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-45455-1_39","volume-title":"Algorithmic Number Theory","author":"J.M. Rojas","year":"2002","unstructured":"Rojas, J.M.: Additive complexity and roots of polynomials over number fields and $\\mathfrak{p}$ -adic fields. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 506\u2013516. Springer, Heidelberg (2002)"},{"key":"12_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1353\/ajm.2004.0005","volume":"126","author":"J.M. Rojas","year":"2004","unstructured":"Rojas, J.M.: Arithmetic multivariate Descartes\u2019 rule. Amer. J. Math.\u00a0126, 1\u201330 (2004)","journal-title":"Amer. J. Math."},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Satoh, T.: On degrees of polynomial interpolations related to elliptic curve cryptography (Extended abstract). In: Workshop on Coding and Cryptography (WCC), pp. 55\u201361 (2005)","DOI":"10.1007\/11779360_13"},{"key":"12_CR38","unstructured":"Shparlinski, I.: Number theoretic methods in cryptography. Complexity lower bounds, Progress in Computer Science and Applied Logic, 17, Birkh\u00e4user, Basel (1999)"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1011264815860","volume":"23","author":"I. Shparlinski","year":"2001","unstructured":"Shparlinski, I.: On the linear complexity of the power generator. Des. Codes Cryptogr.\u00a023, 5\u201310 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Shparlinski, I.: Cryptographic applications of analytic number theory. Complexity lower bounds and pseudorandomness, Progress in Computer Science and Applied Logic, 22, Birkh\u00e4user, Basel (2003)","DOI":"10.1007\/978-3-0348-8037-4_8"},{"key":"12_CR41","first-page":"103","volume-title":"Proceedings of the Ninth IFIP Int. Symp. on Computer Security","author":"P. Smith","year":"1993","unstructured":"Smith, P., Lennon, M.: LUC: a new public key system. In: Proceedings of the Ninth IFIP Int. Symp. on Computer Security, pp. 103\u2013117. North Holland, Amsterdam (1993)"},{"key":"12_CR42","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M. Wiener","year":"1990","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inform. Theory\u00a036, 553\u2013558 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"12_CR43","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-Hellman mapping. Bull. Austral. Math. Soc.\u00a064, 475\u2013477 (2001)","journal-title":"Bull. Austral. Math. Soc."},{"key":"12_CR44","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1012556500517","volume":"25","author":"A. Winterhof","year":"2002","unstructured":"Winterhof, A.: Polynomial interpolation of the discrete logarithm. Des. Codes Cryptogr.\u00a025, 63\u201372 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR45","first-page":"359","volume":"23","author":"A. Winterhof","year":"2004","unstructured":"Winterhof, A.: A note on the linear complexity profile of the discrete logarithm in finite fields. Progress Comp. Sci. Appl. Logic\u00a023, 359\u2013367 (2004)","journal-title":"Progress Comp. Sci. Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779360_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T10:37:40Z","timestamp":1555929460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779360_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354819","9783540354826"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/11779360_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}