{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:15:27Z","timestamp":1764569727639},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,1,22]],"date-time":"2012-01-22T00:00:00Z","timestamp":1327190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10623-011-9605-y","type":"journal-article","created":{"date-parts":[[2012,1,21]],"date-time":"2012-01-21T08:08:08Z","timestamp":1327133288000},"page":"271-292","source":"Crossref","is-referenced-by-count":7,"title":["Simple and exact formula for minimum loop length in Ate i pairing based on Brezing\u2013Weng curves"],"prefix":"10.1007","volume":"67","author":[{"given":"Hoon","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjeong","family":"Lee","sequence":"additional","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":[[2012,1,22]]},"reference":[{"key":"9605_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. Comput. 61, 29\u201368 (1993)","journal-title":"Math. Comput."},{"issue":"3","key":"9605_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., \u00d3 h\u00c9igeartaigh C., Scott M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"9605_CR3","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh D., Franklin M.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9605_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh D., Lynn B., Shacham H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"9605_CR5","first-page":"319","volume-title":"SAC 2005.","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto P.S.L.M., Naehrig M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds) SAC 2005., pp. 319\u2013331. LNCS, vol 3897. Springer (2006)"},{"issue":"1","key":"9605_CR6","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(1), 133\u2013141 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"9605_CR7","unstructured":"Bzde\u0327ga B.: On the height of cyclotomic polynomials. arXiv preprint, arXiv:1012.3897v1, Dec (2010)."},{"issue":"2","key":"9605_CR8","first-page":"122","volume":"9","author":"A.L. Cauchy","year":"1829","unstructured":"Cauchy A.L.: Exercises de mathematique. Oeuvres 9(2), 122 (1829)","journal-title":"Oeuvres"},{"key":"9605_CR9","unstructured":"Duursma I., Lee H.: Tate pairing implementation for hyperelliptic curves y 2 =\u00a0 x p \u2212x +\u00a0d. In: Advances in Cryptography: Proceedings of AsiaCrypt 2003, Lecture Notes in Computer Science, vol. 2894, pp. 111\u2013123. Springer, New York (2003)."},{"key":"9605_CR10","first-page":"452","volume-title":"ANTS 2006 LNCS, vol 4076.","author":"D. Freeman","year":"2006","unstructured":"Freeman D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds) ANTS 2006 LNCS, vol 4076., pp. 452\u2013465. Springer, Heidelberg (2006)"},{"key":"9605_CR11","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, 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"9605_CR12","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.ffa.2007.02.003","volume":"13","author":"S. Galbraith","year":"2007","unstructured":"Galbraith S., McKee J., Valenca P.: Ordinary abelian varieties having small embedding degree. Finite Fields Appl. 13, 800\u2013814 (2007)","journal-title":"Finite Fields Appl."},{"key":"9605_CR13","unstructured":"Hitt L.: On the minimal embedding field. In: Proceedings of Pairing 2007, LNCS 4575, vol. 294\u2013301 (2007)."},{"key":"9605_CR14","unstructured":"Hong H., Lee E., Lee H.S., Park C.M: Maximum gap in inverse cyclotomic polynomials. arXiv Preprint, arXiv 1101.4255, Jan (2011)."},{"key":"9605_CR15","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. Inform. Theory 52, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9605_CR16","doi-asserted-by":"crossref","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."},{"issue":"4","key":"9605_CR17","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. Inform. Theory 55(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9605_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V. Mille","year":"2004","unstructured":"Mille V.: The Weil pairing and its efficient calculation. J. Cryptol. 17, 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"issue":"3","key":"9605_CR19","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.jnt.2008.10.004","volume":"129","author":"P. Moree","year":"2009","unstructured":"Moree P.: Inverse cyclotomic polynomials. J. Numb. Theory 129(3), 667\u2013680 (2009)","journal-title":"J. Numb. Theory"},{"key":"9605_CR20","unstructured":"Sakai R., Ohgishi K., Kasahara M.: Cryptosystems based on pairing. In: Proceedings of Symposium on Cryptography and Information Security, SCIS 2000 (2000)."},{"key":"9605_CR21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1090\/S0025-5718-2010-02373-7","volume":"80","author":"A.V. Sutherland","year":"2011","unstructured":"Sutherland A.V.: Computing Hilbert class polynomials with the Chinese remainder theorem. Math. Comp. 80, 501\u2013538 (2011)","journal-title":"Math. Comp."},{"issue":"1","key":"9605_CR22","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. Inform. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"9605_CR23","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. Inform. Secur. 7(6), 379\u2013382 (2008)","journal-title":"Int. J. Inform. Secur."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9605-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9605-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9605-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T04:22:10Z","timestamp":1593577330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9605-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,22]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9605"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9605-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,22]]}}}