{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:34:23Z","timestamp":1761676463310,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811027406"},{"type":"electronic","value":"9789811027413"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-981-10-2741-3_8","type":"book-chapter","created":{"date-parts":[[2016,9,25]],"date-time":"2016-09-25T23:27:31Z","timestamp":1474846051000},"page":"93-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Improved EllipticNet Algorithm for Tate Pairing on Weierstrass\u2019 Curves, Faster Point Arithmetic and Pairing on Selmer Curves and a Note on Double Scalar Multiplication"],"prefix":"10.1007","author":[{"given":"Srinivasa Rao Subramanya","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,27]]},"reference":[{"key":"8_CR1","unstructured":"Chen, B., Hu, C., Zhao, C.: A note on scalar multiplication using division polynomials. \n                    https:\/\/eprint.iacr.org\/2015\/284.pdf"},{"key":"8_CR2","unstructured":"Costello, C.: Faster formulas for computing cryptographic pairings. Ph.D. thesis, Queensland University of Technology (2012)"},{"key":"8_CR3","unstructured":"Bernstein, D.: Differential addition chains. \n                    http:\/\/cr.yp.to\/ecdh\/diffchain-20060219.pdf"},{"key":"8_CR4","unstructured":"Connell, I.: Elliptic curve handbook (1999). \n                    http:\/\/www.math.mcgill.ca\/connell"},{"issue":"4","key":"8_CR5","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. 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:\n                    10.1007\/978-3-540-73489-5_19"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-21031-0_32","volume-title":"Information Security Practice and Experience","author":"L Zhang","year":"2011","unstructured":"Zhang, L., Wang, K., Wang, H., Ye, D.: Another elliptic curve model for faster pairing computation. In: Bao, F., Weng, J. (eds.) ISPEC 2011. LNCS, vol. 6672, pp. 432\u2013446. Springer, Heidelberg (2011). doi:\n                    10.1007\/978-3-642-21031-0_32"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.2307\/2371930","volume":"70","author":"M Ward","year":"1948","unstructured":"Ward, M.: Memoir on elliptic divisibility sequences. Amer. J. Math. 70, 31\u201374 (1948)","journal-title":"Amer. J. Math."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-73074-3_15","volume-title":"Arithmetic of Finite Fields","author":"N Meloni","year":"2007","unstructured":"Meloni, N.: New point addition formulae for ECC applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 189\u2013201. Springer, Heidelberg (2007). doi:\n                    10.1007\/978-3-540-73074-3_15"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Kanayama, N., Liu, Y., Okamoto, E., Saito, K., Teruya, T., Uchiyama, S.: Implementation of an Elliptic Curve scalar multiplication method using division polynomials. In: IEICE Trans Fundamentals, vol. E97-A, No. 1 (2014)","DOI":"10.1587\/transfun.E97.A.300"},{"key":"8_CR11","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, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). doi:\n                    10.1007\/11586821_2"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Longa, P., Gebotys, C.: Novel precomputation schemes for Elliptic Curve cryptosystems. \n                    https:\/\/eprint.iacr.org\/2008\/256.pdf","DOI":"10.1007\/978-3-642-01957-9_5"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Lin, Q., Zhang, F.: Efficient precomputation schemes of \n                    \n                      \n                    \n                    $$kp+lq$$\n                  . Inf. Process. Lett. 112(Elsevier B.V.), 462\u2013466 (2012)","DOI":"10.1016\/j.ipl.2012.03.010"},{"key":"8_CR14","unstructured":"Shipsey, R.: Elliptic divisibility sequences. Ph.D. thesis, Goldsmith\u2019s College, University of London (2000)"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing, and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"8_CR16","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":"8_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0851-8","volume-title":"Advanced Topics in the Arithmetic of Elliptic Curves","author":"JH Silverman","year":"1994","unstructured":"Silverman, J.H.: Advanced Topics in the Arithmetic of Elliptic Curves. Springer, New York (1994)"},{"key":"8_CR18","unstructured":"Arene, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster computation of the tate pairing. \n                    https:\/\/eprint.iacr.org\/2009\/155.pdf"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-13013-7_15","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"RR Farashahi","year":"2010","unstructured":"Farashahi, R.R., Joye, M.: Efficient arithmetic on Hessian curves. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 243\u2013260. Springer, Heidelberg (2010). doi:\n                    10.1007\/978-3-642-13013-7_15"},{"key":"8_CR20","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. 5365, pp. 400\u2013413. Springer, Heidelberg (2008). doi:\n                    10.1007\/978-3-540-89754-5_31"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Joye, M., Tibouchi, M., Vergnaud, D.: Huffs model for elliptic curves. \n                    http:\/\/eprint.iacr.org\/2010\/383","DOI":"10.1007\/978-3-642-14518-6_20"},{"key":"8_CR22","unstructured":"Zhao, C.A., Zhang, F., Huang, J.: A note on the ate pairing. \n                    https:\/\/eprint.iacr.org\/2007\/247.ps"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 224\u2013242. Springer, Heidelberg (2010). doi:\n                    10.1007\/978-3-642-13013-7_14"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-24209-0_11","volume-title":"Information Security and Cryptology - ICISC 2010","author":"H Gu","year":"2011","unstructured":"Gu, H., Gu, D., Xie, W.L.: Efficient pairing computation on elliptic curves in Hessian form. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 169\u2013176. Springer, Heidelberg (2011). doi:\n                    10.1007\/978-3-642-24209-0_11"}],"container-title":["Communications in Computer and Information Science","Applications and Techniques in Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-2741-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:35:13Z","timestamp":1558514113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-2741-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789811027406","9789811027413"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-2741-3_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"27 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Techniques in Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cairns","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atis2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}