{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:59:32Z","timestamp":1743073172947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030429201"},{"type":"electronic","value":"9783030429218"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42921-8_32","type":"book-chapter","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T15:05:45Z","timestamp":1585926345000},"page":"535-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving ECDLP Computation in Characteristic 2"],"prefix":"10.1007","author":[{"given":"Fangguo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,13]]},"reference":[{"key":"32_CR1","unstructured":"ANSI X9.62-199x: Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 13 January 1998"},{"key":"32_CR2","unstructured":"ANSI X9.63-199x: Public Key Cryptography for the Financial Services Industry: Elliptic Curve Key Agreement and Transport Protocols, 5 October 1997"},{"key":"32_CR3","unstructured":"Bailey, D.V., Batina, L., et al.: Breaking ECC2K-130. Cryptology ePrint Archive, Report 2009\/541 (2009)"},{"issue":"6","key":"32_CR4","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1023\/A:1014525713965","volume":"37","author":"AV Bessalov","year":"2001","unstructured":"Bessalov, A.V.: A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two. Cybern. Syst. Anal. 37(6), 820\u2013823 (2001)","journal-title":"Cybern. Syst. Anal."},{"key":"32_CR5","unstructured":"Certicom: Certicom ECC Challenge (2009). \nhttps:\/\/www.certicom.com\/content\/dam\/ certicom\/images\/pdfs\/challenge-2009.pdf"},{"key":"32_CR6","doi-asserted-by":"publisher","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, vol. 139. Springer, Heidelberg (1993). \nhttps:\/\/doi.org\/10.1007\/978-3-662-02945-9","DOI":"10.1007\/978-3-662-02945-9"},{"issue":"6","key":"32_CR7","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.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., et al.: Field inversion and point halving revisited. IEEE Trans. Comput. 53(8), 1047\u20131059 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"32_CR9","unstructured":"Gallagher, P.: Digital signature standard. Federal Information Processing Standards Publication, February 2013:186\u20133"},{"key":"32_CR10","unstructured":"Harley, R.: Elliptic curve discrete logarithms project. \nhttp:\/\/pauillac.inria.fr\/~harley\/ecdl\/"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1214\/aoms\/1177705677","volume":"31","author":"B Harris","year":"1960","unstructured":"Harris, B.: Probability distribution related to random mappings. Ann. Math. Statist. 31, 1045\u20131062 (1960)","journal-title":"Ann. Math. Statist."},{"key":"32_CR12","unstructured":"Intel: Intel intrinsics guide. \nhttp:\/\/software.intel.com\/sites\/landingpage\/IntrinsicsGuide\/"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-48000-6_12","volume-title":"Advances in Cryptology - ASIACRYPT 99","author":"EW Knudsen","year":"1999","unstructured":"Knudsen, E.W.: Elliptic scalar multiplication using point halving. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 135\u2013149. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-540-48000-6_12"},{"key":"32_CR14","unstructured":"Knuth, D.E.: Seminumerical Algorithms, the Art of Computer Programming. Addison-Wesley, Boston (1997)"},{"issue":"177","key":"32_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 85 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). \nhttps:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"32_CR17","unstructured":"FIPS, PUB: Digital Signature Standard, Federal Information Processing Standards Publication 186. US Department of Commerce, National Institute of Standards and Technology (NIST), National Technical Information Service. Springfield, Virginia (1994)"},{"issue":"143","key":"32_CR18","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard, J.: Monte Carlo methods for index computation mod p. Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"32_CR19","unstructured":"Schroeppel, R.: Elliptic curve point halving wins big. In: The 2nd Midwest Arithmetical Geometry in Cryptography Workshop, Urbana, Illinois, November 2000"},{"key":"32_CR20","unstructured":"Schroeppel, R.: Elliptic curve point ambiguity resolution apparatus and method. U.S. Patent 7,200,225, 3 Apr 2007"},{"key":"32_CR21","doi-asserted-by":"publisher","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. GTM, vol. 106. Springer, New York (2009). \nhttps:\/\/doi.org\/10.1007\/978-0-387-09494-6","DOI":"10.1007\/978-0-387-09494-6"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BFb0054891","volume-title":"Algorithmic Number Theory","author":"E Teske","year":"1998","unstructured":"Teske, E.: Speeding up Pollard\u2019s rho method for computing discrete logarithms. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 541\u2013554. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0054891"},{"issue":"234","key":"32_CR23","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1090\/S0025-5718-00-01213-8","volume":"70","author":"E Teske","year":"2001","unstructured":"Teske, E.: On random walks for Pollard\u2019s rho method. Math. Comput. 70(234), 809\u2013825 (2001)","journal-title":"Math. Comput."},{"issue":"1","key":"32_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P Oorschot Van","year":"1999","unstructured":"Van Oorschot, P., Wiener, M.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"issue":"2","key":"32_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10623-011-9599-5","volume":"67","author":"F Zhang","year":"2013","unstructured":"Zhang, F., Wang, P.: Speeding up elliptic curve discrete logarithm computations with point halving. Des. Codes Cryptogr. 67(2), 197\u2013208 (2013)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42921-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T18:14:18Z","timestamp":1585937658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-42921-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030429201","9783030429218"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42921-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asclab.nuaa.edu.cn\/inscrypt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}