{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:43:38Z","timestamp":1742395418796},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174544"},{"type":"electronic","value":"9783642174551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_26","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T15:31:49Z","timestamp":1290007909000},"page":"417-434","source":"Crossref","is-referenced-by-count":12,"title":["A Variant of Miller\u2019s Formula and Algorithm"],"prefix":"10.1007","author":[{"given":"John","family":"Boxall","sequence":"first","affiliation":[]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Laguillaumie","sequence":"additional","affiliation":[]},{"given":"Duc-Phong","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Ar\u00e8ne, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster computation of the Tate pairing. Preprint, Cryptology ePrint Archive: Report 2009\/155 (2009), http:\/\/eprint.iacr.org\/2009\/155"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","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. Cryptology\u00a011(2), 141\u2013145 (1998)","journal-title":"J. Cryptology"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","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.D., O\u2019Eigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptography"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 17\u201325. Springer, Heidelberg (2003)"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"P.S.L.M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptology\u00a017(4), 321\u2013334 (2004)","journal-title":"J. Cryptology"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","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. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"26_CR7","unstructured":"Bernstein, D., Lange, T.: Explicit-formulas database (2010), http:\/\/www.hyperelliptic.org\/EFD\/"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2005.01.009","volume":"58","author":"I.F. Blake","year":"2006","unstructured":"Blake, I.F., Kumar Murty, V., Xu, G.: Refinements of Miller\u2019s algorithm for computing the Weil\/Tate pairing. J. Algorithms\u00a058(2), 134\u2013149 (2006)","journal-title":"J. Algorithms"},{"key":"26_CR9","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in Elliptic Curves Cryptography","author":"I.F. Blake","year":"2005","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curves Cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0317. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003); Extended abstract in proc. of Crypto 2001","journal-title":"SIAM J. Comput."},{"key":"26_CR11","series-title":"Discrete mathematics and its applications","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H. Cohen","year":"2006","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete mathematics and its applications. Chapman & Hall, Boca Raton (2006)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing 2009","author":"C. Costello","year":"2009","unstructured":"Costello, C., Hisil, H., Boyd, C., Nieto, J.M.G., Wong, K.K.-H.: Faster pairings on special Weierstrass curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 89\u2013101. Springer, Heidelberg (2009)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"PKC 2010","author":"C. Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 224\u2013242. Springer, Heidelberg (2010)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-02620-1_29","volume-title":"Information Security and Privacy","author":"N. El Mrabet","year":"2009","unstructured":"El Mrabet, N., N\u00e8gre, C.: Finite field multiplication combining AMNS and DFT approach for pairing cryptography. In: Boyd, C., Gonz\u00e1lez Nieto, J. (eds.) ACISP 2009. LNCS, vol.\u00a05594, pp. 422\u2013436. Springer, Heidelberg (2009)"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","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. Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing 2008","author":"F. He\u00df","year":"2008","unstructured":"He\u00df, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"issue":"10","key":"26_CR17","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. He\u00df","year":"2006","unstructured":"He\u00df, F., Smart, N.P., Vercauteren, F.: The Eta pairing revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-89754-5_31","volume-title":"INDOCRYPT 2008","author":"S. Ionica","year":"2008","unstructured":"Ionica, S., Joux, A.: Another approach to pairing computation in Edwards coordinates. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 400\u2013413. Springer, Heidelberg (2008)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-14518-6_18","volume-title":"Algorithmic Number Theory","author":"S. Ionica","year":"2010","unstructured":"Ionica, S., Joux, A.: Pairing the volcano. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS-IX. LNCS, vol.\u00a06197, pp. 201\u2013218. Springer, Heidelberg (2010)"},{"issue":"4","key":"26_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptology\u00a017(4), 263\u2013276 (2000); Extended abstract in proc. of ANTS 2000","journal-title":"J. Cryptology"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"issue":"9","key":"26_CR22","doi-asserted-by":"crossref","first-page":"2387","DOI":"10.1093\/ietfec\/e91-a.9.2387","volume":"91-A","author":"X. Lin","year":"2008","unstructured":"Lin, X., Zhao, C., Zhang, F., Wang, Y.: Computing the Ate pairing on elliptic curves with embedding degree k\u2009=\u20099. IEICE Transactions\u00a091-A(9), 2387\u20132393 (2008)","journal-title":"IEICE Transactions"},{"issue":"7","key":"26_CR23","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1587\/transfun.E92.A.1660","volume":"92-A","author":"S. Matsuda","year":"2009","unstructured":"Matsuda, S., Kanayama, N., He\u00df, F., Okamoto, E.: Optimised versions of the Ate and twisted Ate pairings. IEICE Transactions\u00a092-A(7), 1660\u20131667 (2009)","journal-title":"IEICE Transactions"},{"issue":"4","key":"26_CR24","doi-asserted-by":"publisher","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. Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"key":"26_CR25","unstructured":"Shoup, V.: NTL: a library for doing number theory (2009), http:\/\/www.shoup.net\/ntl\/"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2009","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Transactions of Information Theory\u00a056, 455\u2013461 (2009)","journal-title":"IEEE Transactions of Information Theory"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T21:52:42Z","timestamp":1592085162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}