{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:21:43Z","timestamp":1765545703344},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242083"},{"type":"electronic","value":"9783642242090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24209-0_11","type":"book-chapter","created":{"date-parts":[[2011,8,29]],"date-time":"2011-08-29T00:37:43Z","timestamp":1314578263000},"page":"169-176","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Pairing Computation on Elliptic Curves in Hessian Form"],"prefix":"10.1007","author":[{"given":"Haihua","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WenLu","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Ar\u00e8ne, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster Computation of Tate Pairings, Cryptology ePrint Archive, Report 2009\/155, \n                    \n                      http:\/\/eprint.iacr.org\/2009\/155.pdf"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/461\/08979","volume-title":"Finite fields and applications, Contemp. Math.","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T.: Analysis and optimization of elliptic-curve single-scalar multiplication. In: Mullen, G.L., Panario, D., Shparlinski, I.E. (eds.) Finite fields and applications, Contemp. Math., vol.\u00a0461, pp. 1\u201319. American Mathematical Society, Providence (2008)"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR4","first-page":"168","volume-title":"ACM CCS 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Atluri, V., Pfitzmann, B., McDaniel, P. (eds.) ACM CCS 2004, pp. 168\u2013177. ACM Press, New York (2004)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11496618_13","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S. Chatterjee","year":"2005","unstructured":"Chatterjee, S., Sarkar, P., Barua, R.: Efficient computation of Tate pairing in projective coordinate over general characteristic fields. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 168\u2013181. Springer, Heidelberg (2005)"},{"key":"11_CR6","unstructured":"Cheng, Z., Nistazakis, M.: Implementing pairing-based cryptosystems. In: 3rd International Workshop on Wireless Security Technologies IWWST 2005, London, UK (April 2005)"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D.V. Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math.\u00a07(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"C. Costello","year":"2009","unstructured":"Costello, C., Hisil, H., Boyd, C., Nieto, J.M.G., Wong, K.K.H.: Faster pairings on special weierstrass curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 89\u2013101. Springer, Heidelberg (2009)"},{"key":"11_CR9","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp.\u00a062, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-77026-8_11","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"H. Hisil","year":"2007","unstructured":"Hisil, H., Carter, G., Dawson, E.: New formulae for efficient elliptic curve arithmetic. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 138\u2013151. Springer, Heidelberg (2007)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-89754-5_31","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"S. Ionica","year":"2008","unstructured":"Ionica, S., Joux, A.: Another approach to pairing computation in edwards coordinates. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 400\u2013413. Springer, Heidelberg (2008)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2002","unstructured":"Joux, A.: The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002, Part V. LNCS, vol.\u00a02369, pp. 18\u201320. Springer, Heidelberg (2002)"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A. Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol.\u00a017(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-44709-1_33","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"M. Joye","year":"2001","unstructured":"Joye, M., Quisquater, J.-J.: Hessian elliptic curves and side-channel attacks. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 402\u2013410. Springer, Heidelberg (2001)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"11_CR16","unstructured":"Miller, V.S.: Short Programs for Functions on Curves, IBM Watson, T.J. Research Center (1986), \n                    \n                      http:\/\/crypto.stanford.edu\/miller\/miller.ps"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil pairing and its efficient calculation. J. Cryptol.\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-44709-1_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"N.P. Smart","year":"2001","unstructured":"Smart, N.P.: The Hessian form of an elliptic curve. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 118\u2013125. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24209-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T09:33:04Z","timestamp":1554111184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24209-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242083","9783642242090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24209-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}