{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:20Z","timestamp":1725495980058},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401117"},{"type":"electronic","value":"9783540448280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44828-4_7","type":"book-chapter","created":{"date-parts":[[2007,11,18]],"date-time":"2007-11-18T01:09:54Z","timestamp":1195348194000},"page":"51-60","source":"Crossref","is-referenced-by-count":7,"title":["Interpolation of the Elliptic Curve Diffie-Hellman Mapping"],"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":[[2003,4,30]]},"reference":[{"key":"7_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. MIT Press, Cambridge, 1996."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"I.F. Blake, G. Seroussi, and N.P. Smart. Elliptic curves in cryptography, volume 265 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1999.","DOI":"10.1017\/CBO9781107360211"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"J. Buchmann and D. Weber. Discrete logarithms: recent progress. In Coding theory, cryptography and related areas (Guanajuato, (1998), pages 42\u201356, Berlin, 2000. Springer.","DOI":"10.1007\/978-3-642-57189-3_4"},{"key":"7_CR4","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:339\u2013360, 2000.","journal-title":"J. Cryptology"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic cryptosystems. Math. Comp., 48:203\u2013209, 1987.","journal-title":"Math. Comp."},{"key":"7_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07010-9","volume-title":"Elliptic curves: Diophantine analysis","author":"S. Lang","year":"1978","unstructured":"S. Lang. Elliptic curves: Diophantine analysis. Springer, Berlin, 1978."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"T. Lange and A. Winterhof. Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. In 8th Annual International Computing and Combinatorics Conference (COCOON\u201902) (Singapore, 2002), volume 2387 of Lect. Notes Comp. Sci., pages 137\u2013143, Berlin, 2002. Springer.","DOI":"10.1007\/3-540-45655-4_16"},{"issue":"5","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"U.M. Maurer","year":"1999","unstructured":"U.M. Maurer and S. Wolf. The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. SIAM Journal on Computing, 28(5):1689\u20131721, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008302122286","volume":"19","author":"U.M. Maurer","year":"2000","unstructured":"U.M. Maurer and S. Wolf. The Diffie-Hellman Protocol. Designs, Codes, and Cryptography, 19: 147\u2013171, 2000.","journal-title":"Designs, Codes, and Cryptography"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"A.J. Menezes, T. Okamoto, and S.A. Vanstone. Reducing ellipitc curve logarithms to a finite field. IEEE Trans. on Inform. Theory, 39:1639\u20131646, 1993.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"7_CR11","series-title":"CRC Press Series on Discrete Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","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, 1996."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 85","author":"V. Miller","year":"1986","unstructured":"V. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology \u2014 Crypto\u2019 85, volume 263 of Lect. Notes Comput. Sci., pages 417\u2013426, Berlin, 1986. Springer."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. on Inform. Theory, 24:106\u2013110, 1978.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483\u2013494, 1985.","journal-title":"Math. Comp."},{"key":"7_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8664-2","volume-title":"Number theoretic methods in cryptography. Complexity lower bounds","author":"I.E. Shparlinski","year":"1999","unstructured":"I.E. Shparlinski. Number theoretic methods in cryptography. Complexity lower bounds. Birkh\u00e4user, Basel, 1999."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"J.H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate texts in mathematics. Springer, 1986.","DOI":"10.1007\/978-1-4757-1920-8"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44828-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T13:13:32Z","timestamp":1551100412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44828-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401117","9783540448280"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44828-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}