{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T22:46:05Z","timestamp":1698360365525},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. I"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tcsi.2014.2334992","type":"journal-article","created":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T18:46:19Z","timestamp":1413398779000},"page":"3125-3134","source":"Crossref","is-referenced-by-count":9,"title":["Efficient <formula formulatype=\"inline\"><tex Notation=\"TeX\">$M$<\/tex> <\/formula>-ary Exponentiation over <formula formulatype=\"inline\"><tex Notation=\"TeX\">$GF(2^{m})$<\/tex> <\/formula> Using Subquadratic KA-Based Three-Operand Montgomery Multiplier"],"prefix":"10.1109","volume":"61","author":[{"given":"Chiou-Yng","family":"Lee","sequence":"first","affiliation":[]},{"given":"Pramod Kumar","family":"Meher","sequence":"additional","affiliation":[]},{"given":"Chien-Ping","family":"Chang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2013.2264694"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2335031"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","article-title":"A fast algorithm for computing multiplicative inverses in $GF(2^{m})$<\/tex> <\/ref_formula> using normal bases","volume":"78","author":"itoh","year":"1988","journal-title":"Inf Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2013.25"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2004.09.012"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2008.919757"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/92.661252"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/12.293263"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/31.135751"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008208521515"},{"key":"ref28","first-page":"203","article-title":"VLSI architectures for computing exponentiations, multiplicative inverses, divisions in ${\\rm GF}(2^{\\rm m})$<\/tex><\/ref_formula>","author":"wei","year":"1994","journal-title":"Proc ISCAS"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/TC.2005.64","article-title":"Fast bit-parallel $GF(2^{n})$<\/tex> <\/ref_formula> multiplier for all trinomials","volume":"54","author":"fan","year":"2005","journal-title":"IEEE Trans Computers"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.70"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2006.107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921698"},{"key":"ref29","year":"0","journal-title":"NanGate Standard Cell Library"},{"key":"ref5","first-page":"595","article-title":"Multiplication of multidigit numbers on automata","volume":"7","author":"karatsuba","year":"1963","journal-title":"ISoviet Physics-Doklady (English Translation)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1076"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.49"},{"key":"ref2","author":"hankerson","year":"2004","journal-title":"Guide to Elliptic Curve Cryptography"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1109\/TC.2012.239","article-title":"Low-latency digit-serial systolic double basis multiplier over $GF(2^{m})$<\/tex> <\/ref_formula> using subquadratic Toeplitz matrix-vector product approach","volume":"63","author":"pan","year":"2014","journal-title":"IEEE Trans Computers"},{"key":"ref1","article-title":"Digital signature standard","year":"2000","journal-title":"National Institute of Standards and Technology"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1109\/TC.2005.147","article-title":"Low-complexity bit-parallel systolic Montgomery multipliers for special classes of $GF(2^{m})$<\/tex> <\/ref_formula>","volume":"54","author":"lee","year":"2005","journal-title":"IEEE Trans Computers"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.19"},{"key":"ref21","author":"weimerskirch","year":"2003","journal-title":"Generalizations of the Karatsuba Algorithm for Efficient Implementations"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.52"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1981.6159279"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/12.508323"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2009.0039"}],"container-title":["IEEE Transactions on Circuits and Systems I: Regular Papers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8919\/6936397\/06924811.pdf?arnumber=6924811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:40:46Z","timestamp":1642005646000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6924811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":29,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcsi.2014.2334992","relation":{},"ISSN":["1549-8328","1558-0806"],"issn-type":[{"value":"1549-8328","type":"print"},{"value":"1558-0806","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}