{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:15:14Z","timestamp":1729642514915,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/iscc.2008.4625631","type":"proceedings-article","created":{"date-parts":[[2008,9,18]],"date-time":"2008-09-18T15:09:41Z","timestamp":1221750581000},"page":"316-325","source":"Crossref","is-referenced-by-count":2,"title":["Fast multiplication techniques for public key cryptography"],"prefix":"10.1109","author":[{"given":"Vinodh","family":"Gopal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyajit","family":"Grover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael E.","family":"Kounavis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.49"},{"article-title":"generalizations of the karatsuba algorithm for efficient implementations","year":"2003","author":"weimerskirch","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-006-9046-1"},{"key":"1","article-title":"seminumerical algorithms","volume":"2","author":"knuth","year":"1997","journal-title":"The art of computer programming"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_16"},{"key":"6","article-title":"a new method for fast integer multiplication and its application to cryptography","author":"kounavis","year":"2007","journal-title":"Proceedings 2007 International Symposium on Performance Evaluation of Computer and Telecommunication Systems"},{"year":"0","key":"5"},{"key":"4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/ARITH.2003.1207657","article-title":"a less recursive variant of karatsuba-ofman algorithm for multiplying operands of size a power of two","author":"erdem","year":"2003","journal-title":"Proc 10th IEEE Symp Computer Arithmetic"},{"key":"9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(95)00153-P","article-title":"analysis of sliding window techniques for exponentiation","volume":"30","author":"koc","year":"1995","journal-title":"Computers and Mathematics with Applications"},{"article-title":"implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor","year":"1986","author":"barrett","key":"8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/40.502403"}],"event":{"name":"2008 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2008,7,6]]},"location":"Marrakech","end":{"date-parts":[[2008,7,9]]}},"container-title":["2008 IEEE Symposium on Computers and Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4607772\/4625572\/04625631.pdf?arnumber=4625631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T07:52:04Z","timestamp":1497772324000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4625631\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iscc.2008.4625631","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}