{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T12:40:09Z","timestamp":1774010409562,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"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. VLSI Syst."],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tvlsi.2011.2158595","type":"journal-article","created":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T14:26:29Z","timestamp":1309357589000},"page":"1453-1466","source":"Crossref","is-referenced-by-count":64,"title":["Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis"],"prefix":"10.1109","volume":"20","author":[{"given":"R.","family":"Azarderakhsh","sequence":"first","affiliation":[]},{"given":"A.","family":"Reyhani-Masoleh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2004.03.003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_19"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2226-0"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-642-13797-6_3","article-title":"A modified low complexity digit-level Gaussian normal basis multiplier","volume":"6087","author":"azarderakhsh","year":"2010","journal-title":"Proc 3rd Int Workshop Arithmetic of Finite Fields"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-13797-6_4","article-title":"Type-II optimal polynomial bases","volume":"6078","author":"bernstein","year":"2010","journal-title":"Proc 3rd Int Workshop Arithmetic Finite Fields"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"ref36","author":"hankerson","year":"2004","journal-title":"Guide to Elliptic Curve Cryptography"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2010.34"},{"key":"ref34","year":"2000","journal-title":"IEEE Standard Specifications for Public-Key Cryptography"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2007.912228"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90024-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1502781.1502783"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2008.08.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2010.04.006"},{"key":"ref14","first-page":"244","article-title":"Binary Edwards curves","volume":"5154","author":"bernstein","year":"2008","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref15","first-page":"243","article-title":"Efficient arithmetic on Hessian curves","author":"farashahi","year":"2010","journal-title":"Proc 13th Int Conf Practice Theory of Public Key Cryptography"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2010.5541003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2010.5724745"},{"key":"ref18","author":"moloney","year":"2010","journal-title":"Efficient implementation of elliptic curve point operations using binary Edwards curves Cryptology ePrint Archive"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","article-title":"Fast multiplication on elliptic curves over <formula formulatype=\"inline\"><tex Notation=\"TeX\">${GF}(2^{m})$<\/tex><\/formula> without precomputation","author":"lpez","year":"1999","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-540-73074-3_6","article-title":"Efficient multiplication using type 2 optimal normal bases","volume":"4547","author":"gathen","year":"2007","journal-title":"Proc 1st Int Workshop Arithmetic of Finite Fields"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2005.857179"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/ARITH.2003.1207679","article-title":"A low complexity and a low latency bit parallel systolic multiplier over <formula formulatype=\"inline\"> <tex Notation=\"TeX\">${GF}(2^{m})$<\/tex><\/formula> using an optimal normal basis of type II","author":"kwon","year":"2003","journal-title":"Proc 16th IEEE Symp Comput Arithmetic"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2000728"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1076"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.133"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.148"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2008.03.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-X_31"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.65"},{"key":"ref1","year":"2000","journal-title":"U S Dept of Commerce\/NIST Digital Signature Standard FIPS Publications 186-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/12.863045"},{"key":"ref22","first-page":"76","article-title":"Efficient linear array for multiplication in <formula formulatype=\"inline\"><tex Notation=\"TeX\">$GF(2^{m})$<\/tex><\/formula> using a normal basis for elliptic curve cryptography","author":"kwon","year":"2004","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/TC.2006.165","article-title":"Optimum digit serial <formula formulatype=\"inline\"> <tex Notation=\"TeX\">${GF}(2^{m})$<\/tex><\/formula> multipliers for curve-based cryptography","volume":"55","author":"kumar","year":"2006","journal-title":"IEEE Trans Comput"},{"key":"ref42","first-page":"183","article-title":"Weierstra&#x03B2; elliptic curves and side-channel attacks","author":"brier","year":"2002","journal-title":"Proc Int Conf Practice Theory Public Key Cryptography"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.132"},{"key":"ref41","year":"2009","journal-title":"Xilinx Virtex-5 Device Data Sheet"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.10"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1024743"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/12.902754"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00641-8_41"},{"key":"ref25","year":"1986","journal-title":"Computational method and apparatus for finite field arithmetic"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/92\/6218240\/05934394.pdf?arnumber=5934394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:37Z","timestamp":1642006357000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934394\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":44,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2011.2158595","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"value":"1063-8210","type":"print"},{"value":"1557-9999","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}