{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:37:39Z","timestamp":1649079459086},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T00:00:00Z","timestamp":1402444800000},"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":["AAECC"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00200-014-0225-4","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T18:12:13Z","timestamp":1402423933000},"page":"227-247","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial generating pairing and its criterion for optimal pairing"],"prefix":"10.1007","volume":"25","author":[{"given":"Eunjeong","family":"Lee","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":[[2014,6,11]]},"reference":[{"key":"225_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A Atkin","year":"1993","unstructured":"Atkin, A., Morain, F.: Elliptic curves and primality proving. Math. Comp. 61, 29\u201368 (1993)","journal-title":"Math. Comp."},{"issue":"2","key":"225_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s001459900040","volume":"11","author":"R Balasubramanian","year":"1998","unstructured":"Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes\u2013Okamoto\u2013Vanstone algorithm. J. Cryptol. 11(2), 141\u2013145 (1998)","journal-title":"J. Cryptol."},{"issue":"3","key":"225_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"PSLM Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S., \u00d3h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"225_CR4","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig. M.: Pairing-friendly elliptic curves of prime order. Workshop on Selected Areas in Cryptography\u201905. Lecture Notes in Computer Science, vol. 3897, pp. 319\u2013331. Springer, Berlin (2006)","DOI":"10.1007\/11693383_22"},{"key":"225_CR5","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. Des. Codes Cryptogr. 37, 133\u2013141 (2005)","journal-title":"Des. Codes Cryptogr."},{"issue":"3\u20134","key":"225_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"225_CR7","unstructured":"Cocks, C., Pinch, R.G.E.: Identity-based cryptosystems based on the Weil pairing (unpublished manuscript, 2001)"},{"key":"225_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Berlin (1993)"},{"key":"225_CR9","doi-asserted-by":"crossref","unstructured":"Duursma, I., Lee, H.S.: Tate pairing implementation for hyperelliptic curves $$y^2=x^p-x+d$$ y 2 = x p - x + d . 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":"225_CR10","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":"225_CR11","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning $$m$$ 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":"225_CR12","first-page":"18","volume-title":"Pairing-based Cryptography. Pairing 2008, Lecture Notes in Computer Science, vol. 5209","author":"F Hess","year":"2008","unstructured":"Hess, F.: Pairing-based Cryptography. Pairing 2008, Lecture Notes in Computer Science, vol. 5209, pp. 18\u201338. Springer, Berlin (2008)"},{"key":"225_CR13","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":"225_CR14","unstructured":"Kachisa, E., Schaefer, E., Scott, M.: Constructing Brezing\u2013Weng pairing friendly elliptic curves using elements in the cyclotomic elements. In: Pairing-based Cryptography. Pairing 2008, Lecture Notes in Computer Science, vol. 5209, 126\u2013135 (2008)"},{"key":"225_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S Lang","year":"2002","unstructured":"Lang, S.: Algebra, 3rd edn. Springer, Berlin (2002)","edition":"3"},{"issue":"4","key":"225_CR16","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":"225_CR17","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."},{"issue":"1","key":"225_CR18","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"},{"issue":"6","key":"225_CR19","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"C Zhao","year":"2008","unstructured":"Zhao, C., Zhang, F., Huang, J.: A note on the Ate pairing. Int. J. Inf. Secur. 7(6), 379\u2013382 (2008)","journal-title":"Int. J. Inf. Secur."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0225-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-014-0225-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0225-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T11:38:22Z","timestamp":1565523502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-014-0225-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s00200-014-0225-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,11]]}}}