{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:40:47Z","timestamp":1742380847881},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730736"},{"type":"electronic","value":"9783540730743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73074-3_8","type":"book-chapter","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T07:26:47Z","timestamp":1190273207000},"page":"85-102","source":"Crossref","is-referenced-by-count":13,"title":["Software Implementation of Arithmetic in"],"prefix":"10.1007","author":[{"given":"Omran","family":"Ahmadi","sequence":"first","affiliation":[]},{"given":"Darrel","family":"Hankerson","sequence":"additional","affiliation":[]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.dam.2006.06.004","volume":"155","author":"O. Ahmadi","year":"2007","unstructured":"Ahmadi, O., Hankerson, D., Menezes, A.: Formulas for cube roots in . Discrete Applied Mathematics\u00a0155, 260\u2013270 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","volume":"25","author":"D. Ash","year":"1989","unstructured":"Ash, D., Blake, I., Vanstone, S.: Low complexity normal bases. Discrete Applied Mathematics\u00a025, 191\u2013210 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR3","unstructured":"Barreto, P.: A note on efficient computation of cube roots in characteristic 3, Technical Report 2004\/305, Cryptology ePrint Archive (2004)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. Barreto","year":"2007","unstructured":"Barreto, P., Galbraith, S., h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography\u00a042, 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"8_CR5","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. Barreto","year":"2006","unstructured":"Barreto, P., 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":"8_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2226-0","volume-title":"Applications of Finite Fields","author":"I. Blake","year":"1993","unstructured":"Blake, I., Gao, X., Menezes, A., Mullin, R., Vanstone, S., Yaghoobian, T.: Applications of Finite Fields. Kluwer, Dordrecht (1993)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM Journal on Computing\u00a032, 586\u2013615 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Boyen, X., Martin, L.: Identity-based cryptography standard (IBCS) #1: Supersingular curve implementations of the BF and BB1 cryptosystems, IETF Internet Draft (December 2006)","DOI":"10.17487\/rfc5091"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11586821_29","volume-title":"Cryptography and Coding","author":"L. Chen","year":"2005","unstructured":"Chen, L., Cheng, Z.: Security proof of Sakai-Kasahara\u2019s identity-based encryption scheme. In: Smart, N.P. (ed.) Cryptography and Coding. LNCS, vol.\u00a03796, pp. 442\u2013459. Springer, Heidelberg (2005)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1109\/TC.2006.132","volume":"55","author":"R. Dahab","year":"2006","unstructured":"Dahab, R., Hankerson, D., Hu, F., Long, M., L\u00f3pez, J., Menezes, A.: Software multiplication using Gaussian normal bases. IEEE Transactions on Computers\u00a055, 974\u2013984 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers\u00a053, 1047\u20131059 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR12","unstructured":"Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers, Technical Report 2006\/165, Cryptology ePrint Archive (2006)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11545262_29","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"P. Grabher","year":"2005","unstructured":"Grabher, P., Page, D.: Hardware acceleration of the Tate pairing in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 398\u2013411. Springer, Heidelberg (2005)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TC.2005.120","volume":"54","author":"R. Granger","year":"2005","unstructured":"Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three. IEEE Transactions on Computers\u00a054, 852\u2013860 (2005)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR15","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2002","unstructured":"Harrison, K., Page, D., Smart, N.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics\u00a05, 181\u2013193 (2002)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/12.257715","volume":"42","author":"M. Hasan","year":"1993","unstructured":"Hasan, M., Wang, M., Bhargava, V.: A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Transactions on Computers\u00a042, 1278\u20131280 (1993)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR18","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., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR19","unstructured":"Intel Corporation, IA-32 Intel Architecture Software Developer\u2019s Manual, Vol. 1: Basic Architecture. Number 245470-007 (2002), available from http:\/\/developer.intel.com ."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11545262_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"T. Kerins","year":"2005","unstructured":"Kerins, T., Marnane, W., Popovici, E., Barreto, P.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45682-1_5","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A. Lenstra","year":"2001","unstructured":"Lenstra, A.: Unbelievable security: Matching AES security using public key systems. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 67\u201386. Springer, Heidelberg (2001)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-44495-5_18","volume-title":"Progress in Cryptology\u2013Indocrypt 2000","author":"J. L\u00f3pez","year":"2000","unstructured":"L\u00f3pez, J., Dahab, R.: High-speed software multiplication in . In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 203\u2013212. Springer, Heidelberg (2000)"},{"key":"8_CR23","first-page":"1234","volume":"E84-A","author":"A. Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E84-A, 1234\u20131243 (2001)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45600-7_21","volume-title":"Information and Communications Security","author":"P. Ning","year":"2001","unstructured":"Ning, P., Yin, Y.: Efficient software implementation for finite field multiplication in normal basis. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 177\u2013189. Springer, Heidelberg (2001)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-36400-5_38","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"D. Page","year":"2003","unstructured":"Page, D., Smart, N.: Hardware implementation of finite fields of characteristic three. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 529\u2013539. Springer, Heidelberg (2003)"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TC.2006.10","volume":"55","author":"A. Reyhani-Masoleh","year":"2006","unstructured":"Reyhani-Masoleh, A.: Efficient algorithms and architectures for field multiplication using Gaussian normal bases. IEEE Transactions on Computers\u00a055, 34\u201347 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR27","unstructured":"Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve, Technical Report 2003\/054, Cryptology ePrint Archive (2003)"},{"key":"8_CR28","unstructured":"Schirokauer, O.: The number field sieve for integers of low weight, Technical Report 2006\/107, Cryptology ePrint Archive (2006)"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-540-30574-3_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M. Scott","year":"2005","unstructured":"Scott, M.: Computing the Tate pairing. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 293\u2013304. Springer, Heidelberg (2005)"},{"key":"8_CR30","unstructured":"Scott, M.: MIRACL \u2013 Multiprecision Integer and Rational Arithmetic C Library, http:\/\/www.computing.dcu.ie\/~mike\/miracl.html"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Scott, M.: Implementing cryptographic pairings, preprint (2006)","DOI":"10.1007\/11894063_11"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11894063_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"M. Scott","year":"2006","unstructured":"Scott, M., Costigan, N., Abdulwahab, W.: Implementing cryptographic pairings on smartcards. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 134\u2013147. Springer, Heidelberg (2006)"},{"volume-title":"The SPARC Architecture Manual","year":"1994","key":"8_CR33","unstructured":"Weaver, D., Germond, T. (eds.): The SPARC Architecture Manual (Version 9). Prentice-Hall, Englewood Cliffs (1994)"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TC.2002.1047755","volume":"51","author":"H. Wu","year":"2002","unstructured":"Wu, H., Hasan, A., Blake, I., Gao, S.: Finite field multiplier using redundant representation. IEEE Transactions on Computers\u00a051, 1306\u20131316 (2002)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73074-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:58:59Z","timestamp":1619503139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73074-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730736","9783540730743"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73074-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}