{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:43:53Z","timestamp":1765356233581},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016lop0010","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T22:19:47Z","timestamp":1501539587000},"page":"1603-1610","source":"Crossref","is-referenced-by-count":4,"title":["Automatic Generation System for Multiple-Valued Galois-Field Parallel Multipliers"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Rei","family":"UENO","sequence":"first","affiliation":[{"name":"Tohoku University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naofumi","family":"HOMMA","sequence":"additional","affiliation":[{"name":"Tohoku University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takafumi","family":"AOKI","sequence":"additional","affiliation":[{"name":"Tohoku University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Sugawara, R. Ueno, N. Homma, and T. Aoki, \u201cSystem for automatic generation of parallel multipliers over Galois field,\u201d IEEE 45th International Symposium on Multiple-Valued Logic (ISMVL 2015), pp.54-59, 2015. 10.1109\/ismvl.2015.15","DOI":"10.1109\/ISMVL.2015.15"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] E. Savas and C. Koc, \u201cFinite field arithmetic for cryptography,\u201d IEEE Circuits Syst. Mag., vol.10, no.2, pp.40-56, Aug. 2010. 10.1109\/mcas.2010.936785","DOI":"10.1109\/MCAS.2010.936785"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] I. Duursma and H.-S. Lee, \u201cTate pairing implementation for hyperelliptic curves <i>y<\/i><sup>2<\/sup>=<i>x<sup>p<\/sup><\/i>-<i>x<\/i>+<i>d<\/i>,\u201d Advances in Cryptology \u2014 ASIACRYPT 2003, Lecture Notes in Computer Science, vol.2894, pp.111-123, Springer, 2003. 10.1007\/978-3-540-40061-5_7","DOI":"10.1007\/978-3-540-40061-5_7"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] P.S.L.M. Barreto, B. Lynn, and M. Scott, \u201cEfficient implementation of pairing-based cryptosystems,\u201d Journal of Cryptology, vol.17, no.4, pp.321-334, 2004. 10.1007\/s00145-004-0311-z","DOI":"10.1007\/s00145-004-0311-z"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] D.J. Bernstein, N. Duif, T. Lange, P. Schwabe, and B.-Y. Yang, \u201cHigh-speed high-security signatures,\u201d Journal of Cryptographic Engineering, vol.2, no.2, pp.77-89, 2012. 10.1007\/s13389-012-0027-1","DOI":"10.1007\/s13389-012-0027-1"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D. Boneh, B. Lynn, and H. Shacham, \u201cShort signatures from the Weil pairing,\u201d Journal of Cryptology, vol.17, no.4, pp.297-319, 2004. 10.1007\/s00145-004-0314-9","DOI":"10.1007\/s00145-004-0314-9"},{"key":"7","unstructured":"[7] I. Duursma and K. Sakurai, \u201cEfficient algorithms for the Jacobian variety of hyperelliptic curves <i>y<\/i><sup>2<\/sup>=<i>x<sup>p<\/sup><\/i>-<i>x<\/i>+1 over a finite field of odd characteristic <i>p<\/i>,\u201d Coding Theory, Cryptography and Related Areas, pp.73-89, Springer, 1998. 10.1007\/978-3-642-57189-3_6"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] E. Lee, H.-S. Lee, and Y. Lee, \u201cEta pairing computation on general divisors over hyperelliptic curves <i>y<\/i><sup>2<\/sup>=<i>x<sup>p<\/sup><\/i>-<i>x<\/i>+<i>d<\/i>,\u201d Journal of Symbolic Computation, vol.43, no.6-7, pp.452-474, 2008. 10.1016\/j.jsc.2007.07.010","DOI":"10.1016\/j.jsc.2007.07.010"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] N. Homma, K. Saito, and T. Aoki, \u201cA formal approach to designing cryptographic processors based on <i>GF<\/i>(2<i><sup>m<\/sup><\/i>) arithmetic circuits,\u201d IEEE Trans. Inf. Forensics and Security, vol.7, no.1, pp.3-13, Feb. 2012. 10.1109\/tifs.2011.2157687","DOI":"10.1109\/TIFS.2011.2157687"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D. Page and N.P. Smart, \u201cHardware implementation of finite fields of characteristic three,\u201d CHES 2002, Lecture Notes in Computer Science, vol.2523, pp.529-539, 2002. 10.1007\/3-540-36400-5_38","DOI":"10.1007\/3-540-36400-5_38"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] K. Okamoto, N. Homma, and T. Aoki, \u201cA graph-based approach to designing parallel multipliers over Galois fields based on normal basis representations,\u201d Proc. 43th IEEE Int. Symp. Multiple-Valued Logic, pp.158-163, May 2013. 10.1109\/ismvl.2013.5","DOI":"10.1109\/ISMVL.2013.5"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] A. Halbutogullari and C. Koc, \u201cMastrovito multiplier for general irreducible polynomials,\u201d IEEE Trans. Comput., vol.49, no.5, pp.503-518, May 2000. 10.1109\/12.859542","DOI":"10.1109\/12.859542"},{"key":"13","unstructured":"[13] J. Massey and J. Omura, \u201cComputational method and apparatus for finite field arithmetic,\u201d 1986. US Patent."},{"key":"14","unstructured":"[14] \u201cRisa\/Asir (Kobe distribution) download page,\u201d http:\/\/www.math.kobe-u.ac.jp\/Asir\/asir.html"},{"key":"15","unstructured":"[15] \u201cArithmetic module generator for GF parallel multipliers,\u201d http:\/\/www.aoki.ecei.tohoku.ac.jp\/arith\/gfamg\/"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016LOP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T21:37:15Z","timestamp":1569965835000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016LOP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016lop0010","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}