{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:24Z","timestamp":1725491844044},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540756507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75651-4_4","type":"book-chapter","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T07:01:07Z","timestamp":1190358067000},"page":"44-57","source":"Crossref","is-referenced-by-count":1,"title":["Reduction Optimal Trinomials for Efficient Software Implementation of the \u03b7 T Pairing"],"prefix":"10.1007","author":[{"given":"Toshiya","family":"Nakajima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Izu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Barreto, P.S.L.M.: A Note on Efficient Computation of Cube Roots in Characteristic Three, Cryptology ePrint Archive, Report 2004\/305 (2004)"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., \u00d3\u2019h\u00c9igeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Codes and Cryptography"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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\n                  \n                    m\n                  ) Arithmetic Architectures for Cryptographic Applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 158\u2013175. Springer, Heidelberg (2003)"},{"key":"4_CR5","first-page":"97","volume":"18","author":"J.-L. Beuchat","year":"2007","unstructured":"Beuchat, J.-L., Shirase, M., Takagi, T., Okamoto, E.: An Algorithm for the \u03b7\n                  \n                    T\n                   Pairing Calculation in Characteristic Three and its Hardware Implementation. In:18th IEEE International Symposium on Computer Arithmetic, ARITH-18, pp.97\u2013104 (2007)","journal-title":"ARITH-"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"4_CR8","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 Signature from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"4_CR9","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\n                  2\u2009=\u2009x\n                  \n                    p\n                  \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45682-1_29","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"S.D. Galbraith","year":"2001","unstructured":"Galbraith, S.D.: Supersingular Curves in Cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 495\u2013513. Springer, Heidelberg (2001)"},{"key":"4_CR11","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.) ANTS-V 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"issue":"7","key":"4_CR12","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\u2013Based Cryptography in Characteristic Three. IEEE Trans. on Computers\u00a054(7), 852\u2013860 (2005)","journal-title":"IEEE Trans. on Computers"},{"key":"4_CR13","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.) ANTS-IV. LNCS, vol.\u00a01838, pp. 385\u2013393. Springer, Heidelberg (2000)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BFb0055739","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"N. Koblitz","year":"1998","unstructured":"Koblitz, N.: An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 327\u2013337. Springer, Heidelberg (1998)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/11506157_12","volume-title":"Information Security and Privacy","author":"S. Kwon","year":"2005","unstructured":"Kwon, S.: Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol.\u00a03574, pp. 134\u2013145. Springer, Heidelberg (2005)"},{"key":"4_CR16","unstructured":"Miller, V.S.: Short Programs for Functions on Curves, (Unpublished manuscript), available at \n                    \n                      http:\/\/crypto.stanford.edu\/miller\/miller.pdf"},{"key":"4_CR17","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.P.: 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":"4_CR18","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems Based on Pairing. In: Proceedings of the 2000 Symposium on Cryptography and Information Security, SCIS2000-C70 (2000)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-72163-5_20","volume-title":"ISPEC 2007","author":"M. Shirase","year":"2007","unstructured":"Shirase, M., Takagi, T., Okamoto, E.: Some Efficient Algorithms for the Final Exponentiation of \u03b7\n                  \n                    T\n                   Pairing, 3rd Information Security Practice and Experience Conference. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol.\u00a04464, pp. 254\u2013268. Springer, Heidelberg (2007)"},{"issue":"244","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1090\/S0025-5718-03-01515-1","volume":"72","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J.: Irreducible Trinomials over Finite Fields. Math. Comp.\u00a072(244), 1987\u20132000 (2003)","journal-title":"Math. Comp."},{"key":"4_CR21","unstructured":"Risa\/Asir: available at \n                    \n                      http:\/\/www.math.kobe-u.ac.jp\/Asir\/asir.html"},{"key":"4_CR22","unstructured":"Document of 32-bit CPU, available at \n                    \n                      http:\/\/www.fujitsu.com\/us\/services\/edevices\/microelectronics\/microcontrollers\/fr32bitseries\/"},{"key":"4_CR23","unstructured":"Document of 16-bit CPU, available at \n                    \n                      http:\/\/www.fujitsu.com\/us\/services\/edevices\/microelectronics\/microcontrollers\/f2mc\/16lcore.html"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75651-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:26:46Z","timestamp":1619519206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75651-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540756507"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75651-4_4","relation":{},"subject":[]}}