{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T17:01:40Z","timestamp":1791392500399,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662483237","type":"print"},{"value":"9783662483244","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48324-4_4","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T06:27:48Z","timestamp":1441002468000},"page":"63-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Highly Efficient $$GF(2^8)$$ G F ( 2 8 ) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design"],"prefix":"10.1007","author":[{"given":"Rei","family":"Ueno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naofumi","family":"Homma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yukihiro","family":"Sugawara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yasuyuki","family":"Nogami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takafumi","family":"Aoki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,1]]},"reference":[{"key":"4_CR1","unstructured":"Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Specification of \n                      \n                        \n                      \n                      $$Camallia$$\n                      \n                        \n                          \n                            C\n                            a\n                            m\n                            a\n                            l\n                            l\n                            i\n                            a\n                          \n                        \n                      \n                     \u2013 an 128-bit Block Cipher. \n                      http:\/\/info.isl.ntt.co.jp\/crypt\/eng\/camellia\/dl\/01espec.pdf\n                      \n                    , Sep 2001"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyer","year":"2013","unstructured":"Boyer, J., Matthews, M., Peralta, T.: Logic minimization techniques with applications to cryptology. J. Crypt. 26(2), 280\u2013312 (2013)","journal-title":"J. Crypt."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11545262_32","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"D Canright","year":"2005","unstructured":"Canright, D.: A very compact S-Box for AES. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 441\u2013455. Springer, Heidelberg (2005)"},{"key":"4_CR4","unstructured":"Canright, D.: \n                      http:\/\/faculty.nps.edu\/drcanrig\/\n                      \n                    , May 2015"},{"issue":"9","key":"4_CR5","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1109\/12.713313","volume":"47","author":"G Drolet","year":"1997","unstructured":"Drolet, G.: A new representation of elements of finite fields \n                      \n                        \n                      \n                      $$GF(2^m)$$\n                      \n                        \n                          \n                            G\n                            F\n                            (\n                            \n                              2\n                              m\n                            \n                            )\n                          \n                        \n                      \n                     yielding small complexity arithmetic circuits. IEEE Trans. Comput. 47(9), 938\u2013946 (1997)","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"4_CR6","first-page":"790","volume":"J89\u2013A","author":"M Hirotomo","year":"2006","unstructured":"Hirotomo, M., Mohri, M., Morii, M.: Generalized polynomial ring representation over \n                      \n                        \n                      \n                      $$GF(2^{m})$$\n                      \n                        \n                          \n                            G\n                            F\n                            (\n                            \n                              2\n                              m\n                            \n                            )\n                          \n                        \n                      \n                     and its application. IEICE denshijouhoutsushingakkaironbunshi A. J89\u2013A(10), 790\u2013800 (2006). (Japanese edition)","journal-title":"IEICE denshijouhoutsushingakkaironbunshi A."},{"key":"4_CR7","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. \n                      \n                        \n                      \n                      $$GF(2^m)$$\n                      \n                        \n                          \n                            G\n                            F\n                            (\n                            \n                              2\n                              m\n                            \n                            )\n                          \n                        \n                      \n                     using normal bases. Inf. Comput. 78, 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1142\/S0218126610006633","volume":"19","author":"Y Jeon","year":"2010","unstructured":"Jeon, Y., Kim, Y., Lee, D.: A compact memory-free architecture for the AES algorithm using resource sharing methods. J. Circ. Syst. Comput. 19(5), 1109\u20131130 (2010)","journal-title":"J. Circ. Syst. Comput."},{"key":"4_CR9","unstructured":"National Institute of Standards and Technology (NIST): Advanced Encryption Standard (AES) FIPS Publication 197. \n                      http:\/\/csrc.nist.gov\/publications\/fips\/fips197\/fips-197.pdf\n                      \n                    , Nov 2001"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-34117-5_4","volume-title":"Advances in Information and Computer Security","author":"K Nekado","year":"2012","unstructured":"Nekado, K., Nogami, Y., Iokibe, K.: Very short critical path implementation of AES with direct logic gates. In: Hanaoka, G., Yamauchi, T. (eds.) IWSEC 2012. LNCS, vol. 7631, pp. 51\u201368. Springer, Heidelberg (2012)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-15031-9_16","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"Y Nogami","year":"2010","unstructured":"Nogami, Y., Nekado, K., Toyota, T., Hongo, N., Morikawa, Y.: Mixed bases for efficient inversion in \n                      \n                        \n                      \n                      $${\\mathbb{F}}_{((2^{2})^{2})^{2}}$$\n                      \n                        \n                          \n                            F\n                            \n                              \n                                (\n                                \n                                  \n                                    (\n                                    \n                                      2\n                                      2\n                                    \n                                    )\n                                  \n                                  2\n                                \n                                )\n                              \n                              2\n                            \n                          \n                        \n                      \n                     and conversion matrices of subbytes of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 234\u2013247. Springer, Heidelberg (2010)"},{"issue":"9","key":"4_CR12","first-page":"2376","volume":"E86\u2013A","author":"Y Nogami","year":"2003","unstructured":"Nogami, Y., Saito, A., Morikawa, Y.: Finite extension field with modulus of all-one polynomial field and representation of its elements of for fast arithmetnic operations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E86\u2013A(9), 2376\u20132387 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44709-1_16","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"A Rudra","year":"2001","unstructured":"Rudra, A., Dubey, P.K., Jutla, C.S., Kumar, V., Rao, J.R., Rohatgi, P.: Efficient Rijndael encryption implementation with composite field arithmetic. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 171\u2013184. Springer, Heidelberg (2001)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45682-1_15","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A Satoh","year":"2001","unstructured":"Satoh, A., Morioka, S., Takano, K., Munetoh, S.: A compact Rijndael hardware architecture with S-Box optimization. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 239\u2013254. Springer, Heidelberg (2001)"},{"key":"4_CR15","unstructured":"Tohoku University: Cryptographic Hardware Project. \n                      http:\/\/www.aoki.ecei.tohoku.ac.jp\/crypto\/.\n                      \n                    , May 2015"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-48059-5_23","volume-title":"Cryptographic Hardware and Embedded Systems","author":"H Wu","year":"1999","unstructured":"Wu, H., Hasan, M.A., Blake, I.F.: Highly regular architectures for finite field computation using redundant basis. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 269\u2013279. Springer, Heidelberg (1999)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-48059-5_24","volume-title":"Cryptographic Hardware and Embedded Systems","author":"H Wu","year":"1999","unstructured":"Wu, H.: Low complexity Bit-parallel finite field arithmetic using polynomial basis. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 280\u2013291. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems -- CHES 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48324-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T20:03:01Z","timestamp":1566849781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48324-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483237","9783662483244"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48324-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}