{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:06Z","timestamp":1725484266480},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_16","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:37:01Z","timestamp":1179733021000},"page":"137-143","source":"Crossref","is-referenced-by-count":13,"title":["Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm"],"prefix":"10.1007","author":[{"given":"Tanja","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"16_CR1","volume-title":"Algorithmic number theory, Vol.1: Efficient algorithms","author":"E. Bach","year":"1996","unstructured":"E. Bach and J. O. Shallit, Algorithmic number theory, Vol.1: Efficient algorithms. Cambridge: MIT Press 1996."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/978-3-642-57189-3_4","volume-title":"Coding theory, cryptography and related areas (Guanajuato, 1998)","author":"J. Buchmann","year":"2000","unstructured":"J. Buchmann and D. Weber, Discrete logarithms: recent progress. Coding theory, cryptography and related areas (Guanajuato, 1998), 42\u201356, Springer, Berlin, 2000."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s001450010002","volume":"13","author":"D. Coppersmith","year":"2000","unstructured":"D. Coppersmith and I.E. Shparlinski, On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping, J. Cryptology 13 (2000), 339\u2013360.","journal-title":"J. Cryptology"},{"key":"16_CR4","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in cryptology\u2014CRYPTO 2000 (Santa Barbara, CA)","author":"A. K. Lenstra","year":"2000","unstructured":"A. K. Lenstra and E. R. Verheul, The XTR public key system, Advances in cryptology\u2014CRYPTO 2000 (Santa Barbara, CA), 1\u201319, Lecture Notes in Comput. Sci., 1880, Springer, Berlin, 2000."},{"key":"16_CR5","first-page":"49","volume-title":"Proc. Sympos. Appl. Math.","author":"K. S. McCurley","year":"1990","unstructured":"K. S. McCurley, The discrete logarithm problem. Cryptology and computational number theory (Boulder, CO, 1989), 49\u201374, Proc. Sympos. Appl. Math., 42, Amer. Math. Soc., Providence, RI, 1990."},{"key":"16_CR6","volume-title":"CRC Press Series on Discrete Mathematics and its Applications","author":"A. J. Menezes","year":"1997","unstructured":"A. J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton, FL, 1997."},{"key":"16_CR7","first-page":"269","volume-title":"Contemp. Math.","author":"A. M. Odlyzko","year":"1994","unstructured":"A. M. Odlyzko, Discrete logarithms and smooth polynomials. Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993), 269\u2013278, Contemp. Math., 168, Amer. Math. Soc., Providence, RI, 1994."},{"key":"16_CR8","volume-title":"Complexity lower bounds. Progress in Computer Science and Applied Logic","author":"I. E. Shparlinski","year":"1999","unstructured":"I. E. Shparlinski, Number theoretic methods in cryptography. Complexity lower bounds. Progress in Computer Science and Applied Logic, 17. Birkh\u00e4user Verlag, Basel, 1999."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1012556500517","volume":"25","author":"A. Winterhof","year":"2002","unstructured":"A. Winterhof, Polynomial interpolation of the discrete logarithm, Des. Codes Cryptogr. 25 (2002), 63\u201372.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T09:56:21Z","timestamp":1547718981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}