{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:48:48Z","timestamp":1729673328398,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/vlsisoc.2010.5642663","type":"proceedings-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T21:36:29Z","timestamp":1291152989000},"page":"219-224","source":"Crossref","is-referenced-by-count":0,"title":["Low complexity montgomery multiplication architecture for elliptic curve cryptography over GF(p<sup>m<\/sup>)"],"prefix":"10.1109","author":[{"given":"Somsubhra","family":"Talapatra","sequence":"first","affiliation":[]},{"given":"Hafizur","family":"Rahaman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TC.2006.136"},{"year":"2008","author":"baktir","article-title":"Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TC.2005.120"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/FPL.2007.4380669","article-title":"Efficient FPGA-based multipliers for F97and F697","author":"shokrollahi","year":"2007","journal-title":"Proc Int Conf Field Programmable Logic Appl (FPL 2007)"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ReConFig.2008.66"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TC.2003.1228516"},{"key":"ref3","first-page":"95","article-title":"Montgomery Multiplication in GF(2,)","author":"koc","year":"1996","journal-title":"Proc Ann Workshop Selected Areas in Cryptography"},{"year":"2006","author":"rabaey","article-title":"Digital Integrated Circuits: A Design Perspective","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/DSD.2006.23"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1109\/TCSI.2002.800836","article-title":"Low Complexity Parallel Multiplier in FqnOver Fq","volume":"49","author":"wu","year":"2002","journal-title":"IEEE Trans Circ & Syst -I"},{"year":"2004","author":"guajardo merchan","article-title":"Arithmetic Architectures for Finite Fields GF(pm) with Cryptographic Applications","key":"ref7"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.2307\/2007970"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1017\/CBO9781139172769"},{"year":"1999","author":"gathen","article-title":"Modem Computer Algebra","key":"ref9"}],"event":{"name":"2010 18th IEEE\/IFIP International Conference on VLSI and System-on-Chip (VLSI-SoC)","start":{"date-parts":[[2010,9,27]]},"location":"Madrid, Spain","end":{"date-parts":[[2010,9,29]]}},"container-title":["2010 18th IEEE\/IFIP International Conference on VLSI and System-on-Chip"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5629484\/5642591\/05642663.pdf?arnumber=5642663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T16:42:37Z","timestamp":1497890557000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5642663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/vlsisoc.2010.5642663","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}