{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:25:55Z","timestamp":1649139955666},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"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. Inform. Theory"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/tit.2012.2191477","type":"journal-article","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T15:17:08Z","timestamp":1332429428000},"page":"4936-4947","source":"Crossref","is-referenced-by-count":1,"title":["Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group"],"prefix":"10.1109","volume":"58","author":[{"given":"Yasuyuki","family":"Nogami","sequence":"first","affiliation":[]},{"given":"Hidehiro","family":"Kato","sequence":"additional","affiliation":[]},{"given":"Kenta","family":"Nekado","sequence":"additional","affiliation":[]},{"given":"Satoshi","family":"Uehara","sequence":"additional","affiliation":[]},{"given":"Yoshitaka","family":"Morikawa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"441","article-title":"A very compact S-box for AES","volume":"3659","author":"canright","year":"2005","journal-title":"Proc CHES"},{"key":"ref11","first-page":"234","article-title":"Mixed bases for efficient inversion in <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\BBF _{((2^{2})^{2})^{2}}}$<\/tex> <\/formula> and conversion matrices of subbytes of AES","volume":"6225","author":"nogami","year":"2010","journal-title":"Proc CHES"},{"key":"ref12","author":"bailey","year":"0","journal-title":"The certicom challenges ECC2-X"},{"key":"ref13","author":"paar","year":"1994","journal-title":"Efficient VLSI architectures for bit-parallel computation in Galois fields"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.124"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69499-1_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-00988-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.07.0107.0040"},{"key":"ref18","first-page":"469","article-title":"A multiplication algorithm in <formula formulatype=\"inline\"> <tex Notation=\"TeX\">${\\BBF _{p^{m}}}$<\/tex><\/formula> for arbitrary pairs of characteristic <formula formulatype=\"inline\"><tex Notation=\"TeX\">$p$<\/tex> <\/formula> and degree <formula formulatype=\"inline\"><tex Notation=\"TeX\">$m$<\/tex> <\/formula> such that <formula formulatype=\"inline\"><tex Notation=\"TeX\">$p &#x003E; m$<\/tex><\/formula>","author":"yoshida","year":"2007","journal-title":"Proc Joint Workshop Inf Security"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48892-8_7","article-title":"Storage-efficient finite field basis conversion","volume":"1556","author":"kaliski jr","year":"1999","journal-title":"Proc Sel Areas Cryptography"},{"key":"ref4","first-page":"197","article-title":"Implementing cryptographic pairings over Barreto&#x2013;Naehrig curves","volume":"4575","author":"devegili","year":"2007","journal-title":"Proc Pairing"},{"key":"ref3","first-page":"178","article-title":"Integer variable <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\chi $<\/tex><\/formula>-based ate pairing","volume":"5209","author":"nogami","year":"2008","journal-title":"Proc Pairing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/01969720802188201"},{"key":"ref5","author":"knuth","year":"1981","journal-title":"The art of computer programming"},{"key":"ref8","first-page":"248","article-title":"Optimal extension fields for fast arithmetic in public-key algorithms","volume":"1976","author":"bailey","year":"2000","journal-title":"Proc ASIACRYPT 2000"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2008.04.001"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","article-title":"Short signatures from the Weil pairing","volume":"2248","author":"boneh","year":"2001","journal-title":"Proc ASIACRYPT 2001"},{"key":"ref1","author":"lidl","year":"1984","journal-title":"Encyclopedia of Mathematics and its Applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.1500"},{"key":"ref20","author":"shoup","year":"0","journal-title":"A Library for doing Number Theory"},{"key":"ref22","year":"0","journal-title":"The Certicom ECC Challenges ECC2X"},{"key":"ref21","year":"0","journal-title":"SEC 2 Recommended Elliptic Curve Domain Parameters (Version 2 0)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9048-z"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6216490\/06172234.pdf?arnumber=6172234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:42Z","timestamp":1633909902000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6172234\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":23,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2191477","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}