{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:18:26Z","timestamp":1745986706998,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359989"},{"type":"electronic","value":"9783642359996"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35999-6_11","type":"book-chapter","created":{"date-parts":[[2013,1,2]],"date-time":"2013-01-02T01:51:55Z","timestamp":1357091515000},"page":"149-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Efficient Implementation of Bilinear Pairings on ARM Processors"],"prefix":"10.1007","author":[{"given":"Gurleen","family":"Grewal","sequence":"first","affiliation":[]},{"given":"Reza","family":"Azarderakhsh","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Longa","sequence":"additional","affiliation":[]},{"given":"Shi","family":"Hu","sequence":"additional","affiliation":[]},{"given":"David","family":"Jao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Acar, T., Lauter, K., Naehrig, M., Shumow, D.: Affine Pairings on ARM. IACR Cryptology ePrint Archive, 2011:243 (2011), Pairing 2012 (to appear)","DOI":"10.1007\/978-3-642-36334-4_13"},{"key":"11_CR2","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography, http:\/\/code.google.com\/p\/relic-toolkit\/"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D.F. Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster Explicit Formulas for Computing Pairings over Ordinary Curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011)"},{"key":"11_CR4","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":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"Arithmetic of Finite Fields","author":"N. Benger","year":"2010","unstructured":"Benger, N., Scott, M.: Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 180\u2013195. Springer, Heidelberg (2010)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., Gonz\u00e1lez-D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves. In: Joye, et al. (eds.) [11], pp. 21\u201339","DOI":"10.1007\/978-3-642-17455-1_2"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-28496-0_25","volume-title":"Selected Areas in Cryptography","author":"L. Fuentes-Casta\u00f1eda","year":"2012","unstructured":"Fuentes-Casta\u00f1eda, L., Knapp, E., Rodr\u00edguez-Henr\u00edquez, F.: Faster Hashing to ${\\mathbb G}_2$. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol.\u00a07118, pp. 412\u2013430. Springer, Heidelberg (2012)"},{"issue":"8","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"C.C.F. Pereira Geovandro","year":"2011","unstructured":"Pereira Geovandro, C.C.F., Simpl\u00edcio Jr., M.A., Naehrig, M., Barreto, P.S.L.M.: A family of implementation-friendly BN elliptic curves. Journal of Systems and Software\u00a084(8), 1319\u20131326 (2011)","journal-title":"Journal of Systems and Software"},{"key":"11_CR9","unstructured":"IEEE Std. 1363-3\/D1. Draft Standard for Identity-based public key cryptography using pairings (January 2008)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-16825-3_22","volume-title":"Advances in Information and Computer Security","author":"T. Iyama","year":"2010","unstructured":"Iyama, T., Kiyomoto, S., Fukushima, K., Tanaka, T., Takagi, T.: Efficient Implementation of Pairing on BREW Mobile Phones. In: Echizen, I., Kunihiro, N., Sasaki, R. (eds.) IWSEC 2010. LNCS, vol.\u00a06434, pp. 326\u2013336. Springer, Heidelberg (2010)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Pairing-Based Cryptography - Pairing 2010","year":"2010","unstructured":"Joye, M., Miyaji, A., Otsuka, A. (eds.): Pairing 2010. LNCS, vol.\u00a06487. Springer, Heidelberg (2010)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lauter, K., Montgomery, P.L., Naehrig, M.: An analysis of affine coordinates for pairing computation. In: Joye, et al. (eds.) [11], pp. 1\u201320","DOI":"10.1007\/978-3-642-17455-1_1"},{"key":"11_CR13","unstructured":"Longa, P.: High-Speed Elliptic Curve and Pairing-Based Cryptography. PhD thesis, University of Waterloo (April 2011), http:\/\/hdl.handle.net\/10012\/5857"},{"issue":"4","key":"11_CR14","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":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-14712-8_7","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"M. Naehrig","year":"2010","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New Software Speed Records for Cryptographic Pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 109\u2013123. Springer, Heidelberg (2010)"},{"key":"11_CR16","unstructured":"Scott, M.: A note on twists for pairing friendly curves. Personal webpage (2009), ftp:\/\/ftp.computing.dcu.ie\/pub\/resources\/crypto\/twists.pdf"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-25516-8_18","volume-title":"Cryptography and Coding","author":"M. Scott","year":"2011","unstructured":"Scott, M.: On the Efficient Implementation of Pairing-Based Protocols. In: Chen, L. (ed.) IMACC 2011. LNCS, vol.\u00a07089, pp. 296\u2013308. Springer, Heidelberg (2011)"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Transactions on Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35999-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T15:33:12Z","timestamp":1745940792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35999-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642359989","9783642359996"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35999-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}