{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:41:37Z","timestamp":1729633297090,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/arith.2005.34","type":"proceedings-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T17:52:28Z","timestamp":1122486748000},"page":"164-171","source":"Crossref","is-referenced-by-count":15,"title":["Parallel Montgomery Multiplication in GF (2^k) Using Trinomial Residue Arithmetic"],"prefix":"10.1109","author":[{"given":"J.-C.","family":"Bajard","sequence":"first","affiliation":[]},{"given":"L.","family":"Imbert","sequence":"additional","affiliation":[]},{"given":"G.A.","family":"Jullien","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1017\/CBO9781139172769"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-51083-4_67","article-title":"VLSI designs for multiplication over finite fields","volume":"357","author":"mastrovito","year":"1989","journal-title":"Applied Algebra Algebraic Atgorithms and Error-Correcting Codes -AAECC-6"},{"key":"ref12","article-title":"Linköping University","author":"mastrovito","year":"1991","journal-title":"VLSI architectures for computations in Galois fields"},{"year":"1997","author":"menezes","journal-title":"Handbook of Applied Cryptography","key":"ref13"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/3-540-39799-X_31"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.2307\/2007970"},{"key":"ref16","first-page":"149","article-title":"Optimal normal bases in Discrete Applied Mathematics","volume":"22","author":"mullin","year":"1989"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TC.2003.1252850"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TC.2004.52"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/12.769434"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/12.485570"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/40.502403"},{"year":"1980","author":"hamming","journal-title":"Coding and Information Theory","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1023\/A:1008389508626"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/12.257715"},{"year":"2004","author":"hankerson","journal-title":"Guide to Elliptic Curve Cryptography","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1008208521515","article-title":"Montgomery multiplication","volume":"14","author":"\u00e7ko\u00e7","year":"1998","journal-title":"Designs Codes and Cryptography"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/ARITH.2003.1207677","article-title":"Multiplication in for elliptic curve cryptography","author":"bajard","year":"2003","journal-title":"Proceedings. 16th IEEE Symposium on Computer Arithmetic"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/12.736433"}],"event":{"name":"17th IEEE Symposium on Computer Arithmetic (ARITH'05)","location":"Cape Cod, MA, USA"},"container-title":["17th IEEE Symposium on Computer Arithmetic (ARITH'05)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9902\/31474\/01467636.pdf?arnumber=1467636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T21:35:50Z","timestamp":1497648950000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1467636\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/arith.2005.34","relation":{},"subject":[]}}