{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:16:33Z","timestamp":1780956993935,"version":"3.54.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["#138358"],"award-info":[{"award-number":["#138358"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,9,1]]},"DOI":"10.1109\/tc.2014.2375182","type":"journal-article","created":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T15:54:54Z","timestamp":1417017294000},"page":"2421-2432","source":"Crossref","is-referenced-by-count":11,"title":["A Generalization of Addition Chains and Fast Inversions in Binary Fields"],"prefix":"10.1109","volume":"64","author":[{"given":"Kimmo","family":"Jarvinen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassil","family":"Dimitrov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Azarderakhsh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","year":"0"},{"key":"ref11","year":"0"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1137\/S0097539795295663","article-title":"Efficient generation of minimal length addition chains","volume":"28","author":"g","year":"1999","journal-title":"SIAM J Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1939-07068-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90008-0"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/TC.2012.265","article-title":"Fast inversion in $GF(2^m)$ with normal basis using hybrid-double multipliers","volume":"63","author":"azarderakhsh","year":"2014","journal-title":"IEEE Trans Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676616"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90024-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/12.926155"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2013.25"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.disc.2007.04.015","article-title":"On a generalization of addition chains: Addition-multiplication chains","volume":"308","author":"m","year":"2008","journal-title":"Discr Math"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","article-title":"Speeding up the computations of an elliptic curve using addition-subtraction chains","volume":"24","author":"morain","year":"1990","journal-title":"RAIRO-Theor Inf Appl"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/345542.345645"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0205008","article-title":"On the evaluation of powers","volume":"5","author":"c","year":"1976","journal-title":"SIAM J Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-03-01599-0"},{"key":"ref7","article-title":"Data structures for parallel exponentiation in finite fields","author":"n\u00f6cker","year":"2001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90085-7"},{"key":"ref1","author":"knuth","year":"1997","journal-title":"The Art of Computer Programming Vol 2 Seminumerical Algorithms"},{"key":"ref9","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.22"},{"key":"ref22","first-page":"300?314","article-title":"A new bit-serial architecture for field multiplication using polynomial bases","volume":"5154","author":"reyhani-masoleh","year":"0","journal-title":"Proc Int Workshop Cryptogr Hardware Embedded Syst"},{"key":"ref21","year":"2001","journal-title":"Advanced Encryption Standard (AES)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/200883.200896"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9073-6"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7180479\/06967795.pdf?arnumber=6967795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:31Z","timestamp":1641987691000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6967795\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":24,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2375182","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9,1]]}}}