{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:49:17Z","timestamp":1761580157752},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2003.1205958","type":"proceedings-article","created":{"date-parts":[[2003,10,15]],"date-time":"2003-10-15T12:46:31Z","timestamp":1066221991000},"page":"II-268-II-271","source":"Crossref","is-referenced-by-count":12,"title":["FPGA designs of parallel high performance GF(2\/sup 233\/) multipliers [cryptographic applications]"],"prefix":"10.1109","volume":"2","author":[{"given":"C.","family":"Grabbe","sequence":"first","affiliation":[]},{"given":"M.","family":"Bednara","sequence":"additional","affiliation":[]},{"given":"J.","family":"Teich","sequence":"additional","affiliation":[]},{"given":"J.","family":"von zur Gathen","sequence":"additional","affiliation":[]},{"given":"J.","family":"Shokrollahi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"A Comparative VLSI Synthesis of Finite Field Multipliers","author":"paar","year":"1995","journal-title":"Proceedings of the 3rd International Symposium on Communication Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/12.2212"},{"key":"ref10","article-title":"Efficient arithmetic in finite field extensions with application in elliptic curve cryptography","author":"bailey","year":"2000","journal-title":"Journal of Cryptology"},{"key":"ref6","first-page":"51","article-title":"Optimal finite fields for FPGAs","author":"gregory","year":"1999","journal-title":"Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL 99)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.902754"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_3"},{"article-title":"Efficient VLSI Architectures Bit-ParallelComputation in Galois Fields","year":"1994","author":"paar","key":"ref12"},{"article-title":"The Art of Computer Programming, vol. 2. Seminumerical Algorithms","year":"1998","author":"knuth","key":"ref8"},{"article-title":"Finite Field Multiplier Architectures for Cryptographic Applications","year":"2000","author":"el-gebaly","key":"ref7"},{"year":"0","key":"ref2","first-page":"186"},{"article-title":"Modern Computer Algebra","year":"1999","author":"von zur gathen","key":"ref9"},{"article-title":"Exponentiation using addition chains for finite fields","year":"2002","author":"von zur gathen","key":"ref1"}],"event":{"name":"ISCAS 2003. International Symposium on Circuits and Systems","acronym":"ISCAS-03","location":"Bangkok, Thailand"},"container-title":["Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8570\/27136\/01205958.pdf?arnumber=1205958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:14:40Z","timestamp":1489425280000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1205958\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/iscas.2003.1205958","relation":{},"subject":[]}}