{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:34:06Z","timestamp":1648650846676},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,7,19]],"date-time":"2011-07-19T00:00:00Z","timestamp":1311033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00200-011-0146-4","type":"journal-article","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T20:39:50Z","timestamp":1311021590000},"page":"235-248","source":"Crossref","is-referenced-by-count":0,"title":["Optimal pairing computation over families of pairing-friendly elliptic curves"],"prefix":"10.1007","volume":"22","author":[{"given":"Soo-Kyung","family":"Eom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyang-Sook","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheol-Min","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,19]]},"reference":[{"key":"146_CR1","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. Advances in cryptology. In: Proceedings of Crypto 2002, Lecture Notes in Computer Science, Vol. 2442, pp. 354\u2013368. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45708-9_23"},{"issue":"3","key":"146_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto P.S.L.M., Galbraith S., \u00d3h\u00c9igeartaigh C., Scott M.: Efficient pairing computation on supersingular abelian varieties, designs. Codes Cryptogr. 42(3), 239\u2013271 (2007)","journal-title":"Codes Cryptogr."},{"key":"146_CR3","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curveswith prescribed embedding degrees. In: Proceedings of Security in Communication Networks\u2014SCN 2002, Vol. 2576 of Lecture Notes in Computer Science, pp. 263\u2013273. Springer, Berlin (2002)"},{"key":"146_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F. Brezing","year":"2005","unstructured":"Brezing F., Weng A.: Elliptic curves suitable for pairing based cryptography. Designs Codes Cryptogr. 37, 133\u2013141 (2005)","journal-title":"Designs Codes Cryptogr."},{"key":"146_CR5","doi-asserted-by":"crossref","unstructured":"Duursma, I., Lee, H.S.: Tate pairing implementation for hyperelliptic curves y 2\u00a0=\u00a0x p \u2212x +\u00a0d, advances in cryptography. In: Proceedings of AsiaCrypt 2003, Lecture Notes in Computer Science, Vol. 2894, pp. 111\u2013123. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-40061-5_7"},{"issue":"2","key":"146_CR6","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman D., Scott M., Teske E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"issue":"206","key":"146_CR7","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. 62(206), 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"146_CR8","doi-asserted-by":"crossref","unstructured":"Granger, R., Hess, F., Oyono, R., Theriault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves. Advances in cryptology. In: Proceedings of EuroCrypt 2007, LNCS 4515, pp. 430\u2013447. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72540-4_25"},{"key":"146_CR9","doi-asserted-by":"crossref","unstructured":"Hess, F.: Pairing lattices. Pairing-based Cryptography. Pairing 2008, LNCS 5209, pp. 18\u201338. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85538-5_2"},{"key":"146_CR10","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.P., Vercauteren F.: The Eta Pairing Revisited. IEEE Trans. Inf. Theory 52, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"146_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S. Lang","year":"2002","unstructured":"Lang S.: Algebra, revised 3rd edn. Springer, Berlin (2002)","edition":"3"},{"issue":"4","key":"146_CR12","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee E., Lee H.S., Park C.M.: Efficient and generalized pairing computation on abelian varieties. IEEE Trans. Inf. Theory 55(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"146_CR13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-540-77272-9_18","volume":"4887","author":"S. Matsuda","year":"2007","unstructured":"Matsuda S., Kanayama N., Hess F., Okamoto E.: Optimized versions of the Ate and twisted Ate pairings. IMA. Int. Conf. Cryptogr. Coding, LNCS 4887, 302\u2013312 (2007)","journal-title":"IMA. Int. Conf. Cryptogr. Coding, LNCS"},{"issue":"5","key":"146_CR14","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes A., Okamoto T., Vanstone S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory 39(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"146_CR15","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":"146_CR16","unstructured":"Murphy, A., Fitzpatrick, N.: Elliptic curves for pairing applications. Preprint, 2005. Available from http:\/\/eprint.iacr.org\/2005\/302"},{"issue":"1","key":"146_CR17","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. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"146_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, C., Zhang, F., Huang, J.: A note on the Ate pairing. Int. J. Inf. Secur. 7(6), pp. 379-382. Springer, Berlin (2008)","DOI":"10.1007\/s10207-008-0054-1"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-011-0146-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-011-0146-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-011-0146-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T03:04:04Z","timestamp":1560395044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-011-0146-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,19]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["146"],"URL":"https:\/\/doi.org\/10.1007\/s00200-011-0146-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,19]]}}}