{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T05:29:10Z","timestamp":1696051750202},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,27]],"date-time":"2010-03-27T00:00:00Z","timestamp":1269648000000},"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":[[2011,1]]},"DOI":"10.1007\/s10623-010-9383-y","type":"journal-article","created":{"date-parts":[[2010,3,26]],"date-time":"2010-03-26T13:19:18Z","timestamp":1269609558000},"page":"35-44","source":"Crossref","is-referenced-by-count":13,"title":["Computing bilinear pairings on elliptic curves with automorphisms"],"prefix":"10.1007","volume":"58","author":[{"given":"Chang-An","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Dongqing","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jingwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Bing-Long","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,27]]},"reference":[{"key":"9383_CR1","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and its Applications (Boca Raton)","author":"R. Avanzi","year":"2006","unstructured":"Avanzi R., Cohen H., Doche C., Frey G., Lange T., Nguyen K., Vercauteren F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall\/CRC, Boca Raton, FL (2006)"},{"issue":"2","key":"9383_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 sub-exponential discrete log problem under the Menezes\u2013Okamoto\u2013Vanstone algorithm. J. Cryptol. 11(2), 141\u2013145 (1998)","journal-title":"J. Cryptol."},{"issue":"3","key":"9383_CR3","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. Des. Codes Cryptogr. 42(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"9383_CR4","unstructured":"Barreto P.S.L.M., Kim H.Y., Lynn B., Scott M.: Efficient algorithms for pairing-based cryptosystems. In: Proceedings of Advances in Cryptology-Crypto 2002. Lecture Notes in Computer Science, vol. 2442, pp. 354\u2013368. Springer-Verlag, Heidelberg (2002)."},{"key":"9383_CR5","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3), 235\u2013265 (1997). http:\/\/magma.maths.usyd.edu.au\/ ."},{"key":"9383_CR6","unstructured":"Chatterjee S., Sarkar P., Barua R.: Efficient computation of tate pairingin projective coordinate over general characteristic fields, minus in ICISC 2004. Lecture Notes in Computer Science, vol. 3506, pp. 168C181. Springer-Verlag, Heidleberg (2005)."},{"key":"9383_CR7","unstructured":"Duursma I., Gaudry P., Morain F.: Speeding up the discrete log computation on curves with automorphisms. In: Proceedings of Advances in Cryptology-AsiaCrypt 99. Lecture Notes in Computer Science, vol. 1716, pp. 203\u2013121. Springer-Verlag, Heidleberg (1999)."},{"key":"9383_CR8","unstructured":"Duursma I., Lee H.-S.: Tate pairing implementation for hyperelliptic curves y 2\u00a0=\u00a0x p \u2212x\u00a0+\u00a0d. In: Proceedings of Advances in Cryptology-AsiaCrypt\u20192003. Lecture Notes in Computer Science, vol. 2894, pp. 111\u2013123. Springer-Verlag, Heidleberg (2003)."},{"key":"9383_CR9","volume-title":"Advances in Elliptic Curve Cryptography","year":"2005","unstructured":"Galbraith S.:, Pairings, Ch.IX. Blake, I.F., Seroussi, G., Smart, N.P. (eds): Advances in Elliptic Curve Cryptography. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"9383_CR10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10623-008-9233-3","volume":"50","author":"S. Galbraith","year":"2009","unstructured":"Galbraith S., Lin X.: Computing pairings using x-coordinates only. Des. Codes Cryptogr. 50(3), 305\u2013324 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"9383_CR11","unstructured":"Gallant R.P., Lambert R.J., Vanstone S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Proceedings of Advances in Cryptology-Crypto 2001. Lecture Notes in Computer Science, vol. 2139, pp. 190\u2013200. Springer-Verlag, Heidleberg (2001)."},{"key":"9383_CR12","volume-title":"On computing products of pairings. Technical Report CSTR-06-013","author":"R. Granger","year":"2006","unstructured":"Granger R., Smart N.P.: On computing products of pairings. Technical Report CSTR-06-013. University of Bristol, Bristol (2006)"},{"key":"9383_CR13","unstructured":"Hess, F.: Pairing lattices. In: Pairing 2008. Lecture Notes in Computer Science, vol. 5209, pp. 18\u201338. Springer-Verlag, Heidleberg (2008)."},{"issue":"10","key":"9383_CR14","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(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9383_CR15","unstructured":"IEEE Std 1363-2000: Standard Specifications for Public-key Cryptography. IEEE P1363 Working Group (2000)."},{"issue":"6","key":"9383_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ipl.2005.11.005","volume":"97","author":"B.G. Kang","year":"2006","unstructured":"Kang B.G., Park J.H.: On the relationship between squared pairings and plain pairings. Inf. Process. Lett. 97(6), 219\u2013224 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9383_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":"9383_CR18","unstructured":"Matsuda S., Kanayama N., Hess F., Okamoto E.: Optimised versions of the Ate and twisted Ate pairings. In: Cryptography and Coding. Lecture Notes in Computer Science, vol. 4887, pp. 302\u2013312. Springer-Verlag, Heidleberg (2007)."},{"key":"9383_CR19","unstructured":"Menezes A.J., Koblitz N.: Pairing-based cryptography at high security levels. In: Cryptography and Coding. Lecture Notes in Computer Science, vol. 3796, pp. 13\u201336. Springer-Verlag, Heidleberg (2005)."},{"key":"9383_CR20","unstructured":"Miller V.S.: Short programs for functions on curves. http:\/\/crypto.stanford.edu\/miller\/miller.pdf ."},{"issue":"44","key":"9383_CR21","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller V.S.: The Weil pairing and its efficient calculation. J. Cryptol. 17(44), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"9383_CR22","volume-title":"Advances in Elliptic Curve Cryptography","author":"K.G. Paterson","year":"2005","unstructured":"Paterson K.G.: Cryptography from pairing, Ch. X. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds) Advances in Elliptic Curve Cryptography, Cambridge University Press, Cambridge (2005)"},{"key":"9383_CR23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"P.R. Schoof","year":"1995","unstructured":"Schoof P.R.: Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux 7, 219\u2013254 (1995)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"9383_CR24","unstructured":"Scott M.: Faster pairings using an elliptic curve with an efficient endomorphism. In: Progress in Cryptology\u2014IndoCrypt 2005. Lecture Notes in Computer Science, vol. 3797, pp. 258\u2013269. Springer-Verlag, Heidleberg (2005)."},{"key":"9383_CR25","unstructured":"Scott M.: Computing the Tate pairing. In: CT-RSA\u201905. Lecture Notes in Computer Science, vol. 3376, pp. 293\u2013304. Springer-Verlag, Heidleberg (2005)."},{"key":"9383_CR26","unstructured":"Scott M.: Implementing cryptographic pairings. In: Pairing 2007. Lecture Notes in Computer Science, vol. 4575, pp. 177\u2013196. Springer-Verlag, Heidleberg (2007)."},{"key":"9383_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J.H. Silverman","year":"1986","unstructured":"Silverman J.H.: The Arithmetic of Elliptic Curves. Springer-Verlag, New York (1986)"},{"key":"9383_CR28","doi-asserted-by":"crossref","unstructured":"Takashima K.: Scaling security of elliptic curves with fast pairing using efficient endomorphisms. IEICE Trans. Fundam. E90-A(1): 152\u2013159 (2007).","DOI":"10.1093\/ietfec\/e90-a.1.152"},{"issue":"1","key":"9383_CR29","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2009","unstructured":"Vercauteren F.: Optimal pairings. IEEE Trans. Inform. Theory 56(1), 455\u2013461 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"9383_CR30","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"C.-A. Zhao","year":"2008","unstructured":"Zhao C.-A., Zhang F., Zhang F., Zhang F.: A note on the Ate pairing. Int. J. Inf. Secur. 7(6), 379\u2013382 (2008)","journal-title":"Int. J. Inf. Secur."},{"key":"9383_CR31","doi-asserted-by":"crossref","unstructured":"Zhao C.-A., Zhang F., Huang J.: All pairings are in a group. IEICE Trans. Fundam. E91-A(10), 3084\u20133087 (2008).","DOI":"10.1093\/ietfec\/e91-a.10.3084"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9383-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9383-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9383-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T09:10:37Z","timestamp":1591175437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9383-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,27]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9383"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9383-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,27]]}}}