{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:30:29Z","timestamp":1742401829320},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747345"},{"type":"electronic","value":"9783540747352"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74735-2_17","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T06:33:47Z","timestamp":1187764427000},"page":"239-255","source":"Crossref","is-referenced-by-count":12,"title":["Arithmetic Operators for Pairing-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Jean-Luc","family":"Beuchat","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Brisebarre","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Detrey","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Barreto, P.S.L.M.: A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004\/305 (2004)"},{"key":"17_CR2","unstructured":"Barreto, P.S.L.M., Galbraith, S., \u00d3 h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Cryptology ePrint Archive, Report 2004\/375 (2004)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","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":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"17_CR4","volume-title":"Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006)","author":"G. Bertoni","year":"2006","unstructured":"Bertoni, G., Breveglieri, L., Fragneto, P., Pelosi, G.: Parallel hardware architectures for the cryptographic Tate pairing. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006), IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-36563-X_11","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"G. Bertoni","year":"2003","unstructured":"Bertoni, G., Guajardo, J., Kumar, S., Orlando, G., Paar, C., Wollinger, T.: Efficient GF(p m ) arithmetic architectures for cryptographic applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 158\u2013175. Springer, Heidelberg (2003)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., Brisebarre, N., Shirase, M.,Takagi, T., Okamoto, E.: A coprocessor for the final exponentiation of the \u03b7 T pairing in characteristic three. Cryptology ePrint Archive, Report 2007\/045 (2007)","DOI":"10.1007\/978-3-540-73074-3_4"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., Shirase, M.,Takagi, T., Okamoto, E.: An algorithm for the ?T pairing calculation in characteristic three and its hardware implementation. Cryptology ePrint Archive, Report 2006\/327 (2006)","DOI":"10.1109\/ARITH.2007.10"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall\/CRC (2005)","DOI":"10.1201\/9781420034981"},{"key":"17_CR9","unstructured":"Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptographic protocols: A survey. Cryptology ePrint Archive, Report 2004\/64 (2004)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I. Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.S.: Tate pairing implementation for hyperelliptic curves y 2\u2009=\u2009x p \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"issue":"206","key":"17_CR11","doi-asserted-by":"publisher","first-page":"865","DOI":"10.2307\/2153546","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Mathematics of Computation"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"17_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":"17_CR14","doi-asserted-by":"crossref","unstructured":"Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography. Cryptology ePrint Archive, Report 2006\/059 (2006)","DOI":"10.1007\/11792086_34"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases. Information and Computation\u00a078, 171\u2013177 (1988)","journal-title":"Information and Computation"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"17_CR17","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.P., Popovici, E.M., Barreto, P.S.L.M.: 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":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-540-30117-2_10","volume-title":"Field Programmable Logic and Application","author":"T. Kerins","year":"2004","unstructured":"Kerins, T., Popovici, E., Marnane, W.: Algorithms and architectures for use in FPGA implementations of identity based encryption schemes. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol.\u00a03203, pp. 74\u201383. Springer, Heidelberg (2004)"},{"key":"17_CR19","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol.\u00a02. Addision-Wesley, Reading (1998)","edition":"3"},{"key":"17_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. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Kwon, S.: Efficient Tate pairing computation for supersingular elliptic curves over binary fields. Cryptology ePrint Archive, Report 2004\/303 (2004)","DOI":"10.1007\/11506157_12"},{"issue":"5","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing elliptic curves logarithms to logarithms in a finite field. IEEE Transactions on Information Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-71431-6_21","volume-title":"Reconfigurable Computing: Architectures, Tools and Applications \u2013 Proceedings of ARC 2007","author":"F. Rodr\u00edguez-Henr\u00edquez","year":"2007","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Morales-Luna, G., Saqib, N.A., Cruz-Cort\u00e9s, N.: A parallel version of the Itoh-Tsujii multiplicative inversion algorithm. In: Diniz, P.C., Marques, E., Bertels, K., Fernandes, M.M., Cardoso, J.M.P. (eds.) Reconfigurable Computing: Architectures, Tools and Applications \u2013 Proceedings of ARC 2007. LNCS, vol.\u00a04419, pp. 226\u2013237. Springer, Heidelberg (2007)"},{"key":"17_CR24","volume-title":"Cryptographic Algorithms on Reconfigurable Hardware","author":"F. Rodr\u00edguez-Henr\u00edquez","year":"2006","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Saqib, N.A., P\u00e9rez, A.D., Ko\u00e7, \u00c7.K.: Cryptographic Algorithms on Reconfigurable Hardware. Springer, Heidelberg (2006)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Ronan, R., \u00d3 h\u00c9igeartaigh, C., Murphy, C., Kerins, T., Barreto, P.S. L.M.: Hardware implementation of the \u03b7 T pairing in characteristic\u00a03. Cryptology ePrint Archive, Report 2006\/371(2006)","DOI":"10.1109\/FPT.2006.270314"},{"key":"17_CR26","unstructured":"Shirase, M.,Takagi, T., Okamoto, E.: Some efficient algorithms for the final exponentiation of \u03b7 T pairing. Cryptology ePrint Archive, Report 2006\/431 (2006)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystem over binary fields. Cryptology ePrint Archive, Report 2006\/179 (2006)","DOI":"10.1109\/FPT.2006.270309"},{"key":"17_CR28","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)"},{"issue":"2","key":"17_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008013818413","volume":"19","author":"L. Song","year":"1998","unstructured":"Song, L., Parhi, K.K.: Low energy digit-serial\/parallel finite field multipliers. Journal of VLSI Signal Processing\u00a019(2), 149\u2013166 (1998)","journal-title":"Journal of VLSI Signal Processing"},{"issue":"4","key":"17_CR30","first-page":"1247","volume":"28","author":"E.G. Thurber","year":"1999","unstructured":"Thurber, E.G.: Efficient generation of minimal length addition chains. Journal on Computing\u00a028(4), 1247\u20131263 (1999)","journal-title":"Journal on Computing"},{"issue":"4","key":"17_CR31","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"E.R. Verheul","year":"2004","unstructured":"Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. Journal of Cryptology\u00a017(4), 277\u2013296 (2004)","journal-title":"Journal of Cryptology"},{"issue":"247","key":"17_CR32","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1090\/S0025-5718-03-01599-0","volume":"73","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., N\u00f6cker, M.: Computing special powers in finite fields. Mathematics of Computation\u00a073(247), 1499\u20131523 (2003)","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74735-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:32:11Z","timestamp":1683999131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74735-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540747345","9783540747352"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74735-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}