{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T16:39:29Z","timestamp":1791391169740,"version":"4.3.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"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":["J Cryptogr Eng"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s13389-018-0187-8","type":"journal-article","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T22:21:18Z","timestamp":1521498078000},"page":"101-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Highly efficient \n                \n                  \n                \n                $$\\textit{GF}(2^8)$$\n                \n                  \n                    \n                      GF\n                      (\n                      \n                        2\n                        8\n                      \n                      )\n                    \n                  \n                \n               inversion circuit based on hybrid GF representations"],"prefix":"10.1007","volume":"9","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":"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":[[2018,3,20]]},"reference":[{"key":"187_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9314-6","volume-title":"Differential Cryptanalysis of the Data Encryption Standard","author":"E Biham","year":"1993","unstructured":"Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, Berlin (1993)"},{"key":"187_CR2","doi-asserted-by":"crossref","unstructured":"Matsui, M.: The first experimental cryptoanalysis of the data encryption standard. In: Advances in Cryptology\u2014CRYPTO 1994. Volume 839 of Lecture Notes in Computer Science, pp. 1\u201311. Springer (1994)","DOI":"10.1007\/3-540-48658-5_1"},{"key":"187_CR3","doi-asserted-by":"crossref","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Advances in Cryptology\u2014EUROCRYPT 1993. Volume 765 of Lecture Notes in Computer Science, pp. 55\u201364. Springer (1993)","DOI":"10.1007\/3-540-48285-7_6"},{"key":"187_CR4","unstructured":"National Institute of Standards and Technology (NIST): Advanced encryption standard (AES), vol. 197. FIPS Publication. \n                    http:\/\/csrc.nist.gov\/publications\/fips\/fips197\/fips-197.pdf\n                    \n                   (November 2001)"},{"key":"187_CR5","doi-asserted-by":"crossref","unstructured":"Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Camallia: A 128-bit block cipher suitable for multiple platforms\u2014design and analysis. In: Selected Areas in Cryptography. Volume 2012 of Lecture Notes in Computer Science, pp. 39\u201356. Springer (2001)","DOI":"10.1007\/3-540-44983-3_4"},{"key":"187_CR6","doi-asserted-by":"crossref","unstructured":"Moradi, A., Poschmann, A., Ling, S., Paar, C., Wang, H.: Pushing the limits: a very compact and a threshold implementation of AES. In: Advances in Cryptology\u2014EUROCRYPT 2011. Volume 6632 of Lecture Notes in Computer Science, pp. 59\u201388. Springer (2011)","DOI":"10.1007\/978-3-642-20465-4_6"},{"key":"187_CR7","first-page":"287","volume-title":"Logic Synthesis and Optimization. Volume 212 of The Kluwer International Series in Engineering and Computer Science","author":"T Sasao","year":"1993","unstructured":"Sasao, T.: And-Exor expressions and their optimization. In: Sasao, T. (ed.) Logic Synthesis and Optimization. Volume 212 of The Kluwer International Series in Engineering and Computer Science, pp. 287\u2013312. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"187_CR8","doi-asserted-by":"crossref","unstructured":"Morioka, S., Satoh, A.: An optimized S-Box circuit architecture for low power AES design. In: Cryptographic Hardware and Embedded Systems (CHES). Volume 2523 of Lecture Notes in Computer Science, pp. 172\u2013186. Springer (2002)","DOI":"10.1007\/3-540-36400-5_14"},{"key":"187_CR9","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TVLSI.2004.830936","volume":"12","author":"S Morioka","year":"2004","unstructured":"Morioka, S., Satoh, A.: A 10\u00a0Gbps full-AES crypto design with a twisted-BDD S-box architecture. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 12, 686\u2013691 (2004)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"187_CR10","doi-asserted-by":"crossref","unstructured":"Satoh, A., Morioka, S., Takano, K., Munetoh, S.: A compact Rijndael hardware architecture with S-box optimization. In: Advances in Cryptology\u2014ASIACRYPT 2001. Volume 2248 of Lecture Notes in Computer Science, pp. 239\u2013254. Springer (2001)","DOI":"10.1007\/3-540-45682-1_15"},{"key":"187_CR11","doi-asserted-by":"crossref","unstructured":"Canright, D.: A very compact S-box for AES. In: Cryptographic Hardware and Embedded Systems (CHES). Volume 3659 of Lecture Notes in Computer Science, pp. 441\u2013455. Springer (2005)","DOI":"10.1007\/11545262_32"},{"key":"187_CR12","doi-asserted-by":"crossref","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: Cryptographic Hardware and Embedded Systems (CHES). Volume 6225 of Lecture Notes in Computer Science, pp. 234\u2013247. Springer (2010)","DOI":"10.1007\/978-3-642-15031-9_16"},{"issue":"5","key":"187_CR13","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. Circuits Syst. Comput. 19(5), 1109\u20131130 (2010)","journal-title":"J. Circuits Syst. Comput."},{"issue":"9","key":"187_CR14","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."},{"key":"187_CR15","doi-asserted-by":"crossref","unstructured":"Wu, H., Hasan, A., Blake, I.F.: Highly regular architectures for finite field computation using redundant basis. In: Workshop on Cryptographic Hardware and Embedded Systems (CHES). Volume 1717 of Lecture Notes in Computer Science, pp. 269\u2013279. Springer (1999)","DOI":"10.1007\/3-540-48059-5_23"},{"key":"187_CR16","doi-asserted-by":"crossref","unstructured":"Nekado, K., Nogami, Y., Iokibe, K.: Very short critical path implementation of AES with direct logic gates. In: Advances in Information and Computer Security. Volume 7631 of Lecture Notes in Computer Science, pp. 51\u201368. Springer (2012)","DOI":"10.1007\/978-3-642-34117-5_4"},{"key":"187_CR17","doi-asserted-by":"crossref","unstructured":"Ueno, R., Homma, N., Sugawara, Y., Nogami, Y., Aoki, T.: Highly efficient \n                    \n                      \n                    \n                    $$GF(2^8)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            8\n                          \n                          )\n                        \n                      \n                    \n                   inversion circuit based on redundant GF arithmetic and its application to AES design. In: International Workshop on Cryptographic Hardware and Embedded Systems (CHES). Volume 9293 of Lecture Notes in Computer Science, pp. 63\u201380. Springer (2015)","DOI":"10.1007\/978-3-662-48324-4_4"},{"key":"187_CR18","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."},{"key":"187_CR19","doi-asserted-by":"crossref","unstructured":"Wu, H.: Low complexity bit-parallel finite field arithmetic using polynomial basis. In: Workshop on Cryptographic Hardware and Embedded Systems (CHES). Volume 1717 of Lecture Notes in Computer Science, pp. 280\u2013291. Springer (1999)","DOI":"10.1007\/3-540-48059-5_24"},{"issue":"10","key":"187_CR20","first-page":"790","volume":"J89\u2013A","author":"M Hirotomo","year":"2006","unstructured":"Hirotomo, M., Mouri, K., 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 Trans. Fundam. Electron. Commun. Comput. Sci. J89\u2013A(10), 790\u2013800 (2006). (Japanese Edition)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"9","key":"187_CR21","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":"187_CR22","unstructured":"Tohoku University: Cryptographic hardware project. \n                    http:\/\/www.aoki.ecei.tohoku.ac.jp\/crypto\/\n                    \n                   May 2015"},{"key":"187_CR23","unstructured":"Canright, D.: \n                    http:\/\/faculty.nps.edu\/drcanrig\/\n                    \n                   May (2015)"},{"key":"187_CR24","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1109\/JSSC.2011.2108131","volume":"46","author":"SK Mathew","year":"2011","unstructured":"Mathew, S.K., Sheikh, F., Kounavis, M.E., Gueron, S., Agarwal, A., Hsu, S.K., Himanshu, K., Anders, M.A., Krishnamurthy, R.K.: 53 Gbps native \n                    \n                      \n                    \n                    $$GF(2^4)^2$$\n                    \n                      \n                        \n                          G\n                          F\n                          \n                            \n                              (\n                              \n                                2\n                                4\n                              \n                              )\n                            \n                            2\n                          \n                        \n                      \n                    \n                   composite-field AES-encrypt\/decrypt accelerator for content-protection in 45\u00a0nm high-performance microprocessors. IEEE J. Solid State Circuits 46, 767\u2013776 (2011)","journal-title":"IEEE J. Solid State Circuits"},{"key":"187_CR25","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/JSSC.2014.2384039","volume":"50","author":"S Mathew","year":"2015","unstructured":"Mathew, S., Satpathy, S., Suresh, V., Anders, M., Himanshu, K., Amit, A., Hsu, S., Chen, G., Krishnamurthy, R.K.: 340 mV-1.1V, 289 Gbps\/W, 2090-gate nanoAES hardware accelerator with area-optimized encrypt\/decrypt \n                    \n                      \n                    \n                    $$GF(2^4)^2$$\n                    \n                      \n                        \n                          G\n                          F\n                          \n                            \n                              (\n                              \n                                2\n                                4\n                              \n                              )\n                            \n                            2\n                          \n                        \n                      \n                    \n                   polynomials in 22 nm tri-gate CMOS. IEEE J. Solid State Circuits 50, 1048\u20131058 (2015)","journal-title":"IEEE J. Solid State Circuits"},{"key":"187_CR26","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"47","author":"J Boyer","year":"2013","unstructured":"Boyer, J., Matthews, P., Peralta, P.: Logic minimization techniques with applications to cryptology. J. Cryptol. 47, 280\u2013312 (2013)","journal-title":"J. Cryptol."},{"key":"187_CR27","doi-asserted-by":"crossref","unstructured":"Boyer, J., Peralta, R.: A small depth-16 circuit for the AES S-box. In: Information Security and Privacy Research. Volume 376 of IFIP Advances in Information and Communication Technology, pp. 287\u2013298. Springer (2012)","DOI":"10.1007\/978-3-642-30436-1_24"},{"key":"187_CR28","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/s00145-010-9085-7","volume":"24","author":"S Nikova","year":"2011","unstructured":"Nikova, S., Rijmen, V., Schl\u00e4ffer, M.: Secure hardware implementation of nonlinear functions in the presence of glitches. J. Cryptol. 24, 292\u2013321 (2011)","journal-title":"J. Cryptol."},{"key":"187_CR29","doi-asserted-by":"crossref","unstructured":"Bilgin, B., Gierlichs, B., Nikov, V., Rijmen, V.: Higher-order threshold implementations. In: Advances in Cryptology\u2014ASIACRYPT 2014. Volume 8874 of Lecture Notes in Computer Science, pp. 326\u2013343. Springer (2014)","DOI":"10.1007\/978-3-662-45608-8_18"},{"key":"187_CR30","doi-asserted-by":"crossref","unstructured":"Reparaz, O., Bilgin, B., Nikova, S., Gierlichs, B., Verbauwhede, I.: Consolidating masking schemes. In: Advances in Cryptology\u2014CRYPTO 2015. Volume 9215 of Lecture Notes in Computer Science, pp. 764\u2013783. Springer (2015)","DOI":"10.1007\/978-3-662-47989-6_37"},{"key":"187_CR31","unstructured":"Cnudde, T.D., Reparaz, O., Bilgin, B., Nikova, S., Nikov, V., Rijmen, V.: Masking AES with \n                    \n                      \n                    \n                    $$d+1$$\n                    \n                      \n                        \n                          d\n                          +\n                          1\n                        \n                      \n                    \n                   shares in hardware. In: International Conference on Cryptographic Hardware and Embedded Systems (CHES). Volume 9813 of Lecture Notes in Computer Science, pp. 194\u2013212. Springer (2016)"},{"key":"187_CR32","unstructured":"Tiri, K., Verbauwhede, I.: A logic level design methodology for a secure DPA resistant ASIC or FPGA implementation. In: Design, Automation and Test in Europe Conference and Exhibition (DATE), vol. 1, pp. 246\u2013251. (2004)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-018-0187-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:30:08Z","timestamp":1558013408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-018-0187-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["187"],"URL":"https:\/\/doi.org\/10.1007\/s13389-018-0187-8","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"6 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}