{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T09:28:19Z","timestamp":1700472499269},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T00:00:00Z","timestamp":1518393600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10878-018-0257-y","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T02:51:57Z","timestamp":1518403917000},"page":"1086-1103","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An optimal Tate pairing computation using Jacobi quartic elliptic curves"],"prefix":"10.1007","volume":"35","author":[{"given":"Srinath","family":"Doss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roselyn","family":"Kaondera-Shava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,12]]},"reference":[{"key":"257_CR1","unstructured":"Ar\u00e8ne C, Lange T, Naehrig M, Ritzenthaler M (2009) Faster computation of tate pairings. Cryptology ePrint Archive, Report 2009\/155. http:\/\/eprint.iacr.org\/2009\/155.pdf . Accessed May 2016"},{"key":"257_CR2","unstructured":"Barreto PSLM (2005) Pairing-based crypto lounge. http:\/\/planeta.terra.com.br\/informatica\/paulobarreto\/pblounge.html . Accessed May 2016"},{"issue":"3","key":"257_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh D, Franklin M (2003) Identity based encryption from the Weil pairing. SIAM J Comput 32(3):586\u2013615","journal-title":"SIAM J Comput"},{"key":"257_CR4","doi-asserted-by":"crossref","unstructured":"Duquesne S, Fouotsa E (2013) Tate pairing computation on Jacobis elliptic curves. In: Proceedings of the 5th international conference on pairing based cryptography, pp. 254\u2013269 (2012)","DOI":"10.1007\/978-3-642-36334-4_17"},{"issue":"4","key":"257_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1515\/jmc-2013-0033","volume":"8","author":"S Duquesne","year":"2014","unstructured":"Duquesne S, El Mrabet N, Fouotsa E (2014) Efficient computation of pairings on Jacobi quartic elliptic curves. J Math Cryptol 8(4):331\u2013362","journal-title":"J Math Cryptol"},{"key":"257_CR6","unstructured":"Freeman D, Scott M, Teske E (2006) A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2006\/372. http:\/\/eprint.iacr.org\/2006\/372.pdf . Accessed May 2016"},{"key":"257_CR7","unstructured":"Huseyin H, Koon-Ho Wong K, Carter G, Dawson E (2009) Jacobi quartic curves revisited. Cryptology ePrint Archive, Report 2009\/312, 2009. http:\/\/eprint.iacr.org\/2009\/312.pdf . Accessed May 2016"},{"key":"257_CR8","series-title":"lecture notes in computer science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"ANTS-IV: 4th International symposium on algorithmic number theory","author":"A Joux","year":"2000","unstructured":"Joux A (2000) A one round protocol for tripartite Diffie-Hellman. ANTS-IV: 4th International symposium on algorithmic number theory, vol 1883. lecture notes in computer science. Springer, Berlin, pp 385\u2013394"},{"issue":"177","key":"257_CR9","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 (1987) Elliptic curve cryptosystems. Math Comput 48(177):203\u2013209","journal-title":"Elliptic curve cryptosystems. Math Comput"},{"key":"257_CR10","series-title":"lecture notes in computer science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in cryptology CRYPTO 1985","author":"V Miller","year":"1986","unstructured":"Miller V (1986) Use of elliptic curves in cryptography. Advances in cryptology CRYPTO 1985, vol 218. lecture notes in computer science. Springer, Berlin, pp 417\u2013426"},{"key":"257_CR11","unstructured":"Miyaji A, Nakabayashi N, Takano S (2001) New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans Fundam E84\u2013A(5):1234\u20131243"},{"key":"257_CR12","unstructured":"Sakai R, Ohgishi K, Kasahara M (2000) Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security SCIS 2000"},{"key":"257_CR13","doi-asserted-by":"crossref","unstructured":"Silverman JH (1986) The arithmetic of elliptic curves, volume 106 of graduate texts in mathematics. Springer, Berlin","DOI":"10.1007\/978-1-4757-1920-8"},{"issue":"4","key":"257_CR14","first-page":"655","volume":"20","author":"H Wang","year":"2011","unstructured":"Wang H, Wang K, Zhang L, Li B (2011) Pairing computation on elliptic curves of Jacobi quartic form. Chin J Electron 20(4):655\u2013661","journal-title":"Chin J Electron"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0257-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T16:17:35Z","timestamp":1570724255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0257-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,12]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0257-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,12]]},"assertion":[{"value":"12 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}