{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:02:54Z","timestamp":1742968974758,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445236"},{"type":"electronic","value":"9783319445243"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44524-3_19","type":"book-chapter","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T11:32:52Z","timestamp":1473334372000},"page":"319-334","source":"Crossref","is-referenced-by-count":2,"title":["Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Onuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadanori","family":"Teruya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Kanayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigenori","family":"Uchiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,9]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-642-25516-8_17","volume-title":"Cryptography and Coding","author":"DF Aranha","year":"2011","unstructured":"Aranha, D.F., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Parallelizing the Weil and tate pairings. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 275\u2013295. Springer, Heidelberg (2011)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess, F., Smart, N., Vercauteren, F.: The eta pairing revisited. IEEE Trans. Inf. Theory 52, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V Miller","year":"2004","unstructured":"Miller, V.: The Weil pairing, and its efficient calculation. J. Cryptol. 17, 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-25141-2_5","volume-title":"Advances in Information and Computer Security","author":"N Ogura","year":"2011","unstructured":"Ogura, N., Kanayama, N., Uchiyama, S., Okamoto, E.: Cryptographic pairings based on elliptic nets. In: Iwata, T., Nishigaki, M. (eds.) IWSEC 2011. LNCS, vol. 7038, pp. 65\u201378. Springer, Heidelberg (2011)"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.14495\/jsiaml.8.9","volume":"8","author":"H Onuki","year":"2016","unstructured":"Onuki, H., Teruya, T., Kanayama, N., Uchiyama, S.: The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets. JSIAM Lett. 8, 9\u201312 (2016)","journal-title":"JSIAM Lett."},{"key":"19_CR7","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"1992","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Springer, New York (1992)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-540-73489-5_19","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"KE Stange","year":"2007","unstructured":"Stange, K.E.: The tate pairing via elliptic nets. In: Takagi, T., Okamoto, E., Okamoto, T., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 329\u2013348. Springer, Heidelberg (2007)"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theor. 56, 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"19_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves: Number Theory and Cryptography","author":"LC Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography. Chapman and Hall\/CRC, Boca Raton (2008)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44524-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:15:00Z","timestamp":1498328100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44524-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445236","9783319445243"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44524-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}