{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:37:27Z","timestamp":1758476247934},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540897538"},{"type":"electronic","value":"9783540897545"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89754-5_31","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T07:11:54Z","timestamp":1227683514000},"page":"400-413","source":"Crossref","is-referenced-by-count":30,"title":["Another Approach to Pairing Computation in Edwards Coordinates"],"prefix":"10.1007","author":[{"given":"Sorina","family":"Ionica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Joux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 389\u2013405. Springer, Heidelberg (2008)"},{"key":"31_CR2","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database (2007), http:\/\/hyperelliptic.org\/EFD\/"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D.J. Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"31_CR4","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in Elliptic Curve Cryptography","author":"I.F. Blake","year":"2005","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0317. Cambridge University Press, Cambridge (2005)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"31_CR7","first-page":"168","volume-title":"ACM CCS 2004: 11th Conference on Computer and Communications Security","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Atluri, V., Pfitzmann, B., McDaniel, P. (eds.) ACM CCS 2004: 11th Conference on Computer and Communications Security, pp. 168\u2013177. ACM Press, New York (2004)"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.5802\/jtnb.301","volume":"13","author":"W. Bosma","year":"2001","unstructured":"Bosma, W.: Signed bits and fast exponentiation. J. de th\u00e9orie des nombres de Bordeaux\u00a013(1), 27\u201341 (2001)","journal-title":"J. de th\u00e9orie des nombres de Bordeaux"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","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 Cryptography\u00a037(1), 133\u2013141 (2005)","journal-title":"Des. Codes Cryptography"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Sarkar, P., Barua, R.: Efficient computation of Tate pairing in projective coordinate over general characteristic fields (2004)","DOI":"10.1007\/11496618_13"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-79549-0","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"M.P.L. Das","year":"2008","unstructured":"Das, M.P.L., Sarkar, P.: Pairing computation on twisted Edwards form elliptic curves. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209. Springer, Heidelberg (2008)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H.M. Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bull. AMS\u00a044, 393\u2013422 (2007)","journal-title":"Bull. AMS"},{"key":"31_CR13","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2006\/372 (2006), http:\/\/eprint.iacr.org\/"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Granger, R., Hess, F., Oyono, R., Th\u00e9riault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves (2007)","DOI":"10.1007\/978-3-540-72540-4_25"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11792086_34","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 480\u2013494. Springer, Heidelberg (2006)"},{"key":"31_CR16","series-title":"Graduate texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3849-0","volume-title":"Algebraic Geometry","author":"R. Hartshorne","year":"1977","unstructured":"Hartshorne, R.: Algebraic Geometry. Graduate texts in Mathematics, vol.\u00a052. Springer, Heidelberg (1977)"},{"key":"31_CR17","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Ionica, S., Joux, A.: Another approach on pairing computation in Edwards coordinates. Cryptology ePrint Archive, Report 2008\/292 (2008), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-89754-5_31"},{"issue":"4","key":"31_CR19","doi-asserted-by":"publisher","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. Journal of Cryptology\u00a017(4), 263\u2013276 (2004)","journal-title":"Journal of Cryptology"},{"key":"31_CR20","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":"4","key":"31_CR21","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. Journal of Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"31_CR22","series-title":"Graduate texts in Mathematics","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. Graduate texts in Mathematics, vol.\u00a0106. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89754-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:45:53Z","timestamp":1557931553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89754-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540897538","9783540897545"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89754-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}