{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T22:16:39Z","timestamp":1791065799776,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540008477","type":"print"},{"value":"9783540365631","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36563-x_24","type":"book-chapter","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T14:24:59Z","timestamp":1194013499000},"page":"343-354","source":"Crossref","is-referenced-by-count":49,"title":["Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation"],"prefix":"10.1007","author":[{"given":"Kirsten","family":"Eisentr\u00e4ger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter L.","family":"Montgomery","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"24_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology-Crypto 2002","author":"P. S. L. M. Barreto","year":"2002","unstructured":"Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn and Michael Scott, Efficient algorithms for pairing-based cryptosystems, in Advances in Cryptology-Crypto 2002, M. Yung (Ed.), LNCS 2442, Springer-Verlag, 2002, pp. 354\u2013368. 349, 350"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"I. F. Blake, G. Seroussi, N. P. Smart, Elliptic Curves in Cryptography, LMS 265 Cambridge University Press, 1999. 344, 346","DOI":"10.1017\/CBO9781107360211"},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","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":"Dan Boneh and Matt Franklin, Identity-based encryption from the Weil pairing, in Advances in Cryptology-Crypto 2001, J. Kilian (Ed.), LNCS 2139, Springer-Verlag, 2001, pp. 213\u2013229. Appendix available at http:\/\/crypto.stanford.edu\/~dabo\/papers\/ibe.pdf . 349"},{"key":"24_CR4","series-title":"Lect Notes Comput Sci","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":"Dan Boneh, Ben Lynn, and Hovav Shacham, Short signatures from the Weil pairing, in Advances in Cryptology-Asiacrypt 2001, C. Boyd (Ed.), LNCS 2248, Springer-Verlag, 2001, pp. 514\u2013532. 352"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D. M. Gordon","year":"1998","unstructured":"D. M. Gordon, A survey of fast exponentiation methods, J. Algorithms, 27, pp. 129\u2013146, 1998. 345, 347","journal-title":"J. Algorithms"},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45455-1_3","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2002","unstructured":"Antoine Joux, The Weil and Tate Pairings as building blocks for public key cryptosystems (survey), in Algorithmic Number Theory, 5th International Symposium ANTS-V, Sydney, Australia, July 7\u201312, 2002 Proceedings, Claus Fieker and David R. Kohel (Eds.), LNCS 2369, Springer-Verlag, 2002, pp. 20\u201332. 349"},{"key":"24_CR7","unstructured":"Donald E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, Addison-Wesley, 3rd edition, 1997. 345"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"C. K. Ko\u00e7 and E. Sava\u015f, Architectures for Unified Field Inversion with Applications in Elliptic Curve Cryptography, The 9th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2002, Dubrovnik, Croatia, September 15\u201318, 2002, vol. 3, pp. 1155\u20131158. 346","DOI":"10.1109\/ICECS.2002.1046457"},{"key":"24_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"Selected Areas in Cryptography 2001, Toronto, Ontario","author":"B. M\u00f6ller","year":"2002","unstructured":"Bodo M\u00f6ller, Algorithms for multi-exponentiation, in Selected Areas in Cryptography 2001, Toronto, Ontario, Serge Vaudenay and Amr M. Youssef(Eds.), LNCS 2259, Springer-Verlag, 2002, pp. 165\u2013180"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"P. L. Montgomery","year":"1987","unstructured":"Peter L. Montgomery, Speeding the Pollard and Elliptic Curve Methods of Factorization, Math. Comp., v. 48(1987), pp. 243\u2013264. 349","journal-title":"Math. Comp."},{"key":"24_CR11","unstructured":"Peter L. Montgomery, Evaluating Recurrences of Form Xm+n = f(Xm, Xn, Xm-n) via Lucas Chains. Available at ftp:\/\/ftp.cwi.nl:\/pub\/pmontgom\/lucas.ps.gz . 349"},{"key":"24_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45537-X_21","volume-title":"Selected Areas in Cryptography 2001, Toronto, Ontario","author":"Y. Sakai","year":"2002","unstructured":"Yasuyuki Sakai, Kouichi Sakurai, On the Power of Multidoubling in Speeding up Elliptic Scalar Multiplication, in Selected Areas in Cryptography 2001, Toronto, Ontario, Serge Vaudenay and Amr M. Youssef(Eds.), LNCS 2259, Springer-Verlag, 2002, pp. 268\u2013283. 347"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Joseph H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, GTM 106, 1986. 344, 349, 353","DOI":"10.1007\/978-1-4757-1920-8"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36563-X_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T02:05:22Z","timestamp":1737511522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36563-X_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008477","9783540365631"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36563-x_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}