{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:59Z","timestamp":1725561359508},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_74","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"726-735","source":"Crossref","is-referenced-by-count":1,"title":["Unfolded Modular Multiplication"],"prefix":"10.1007","author":[{"given":"Wieland","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"74_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A.D. Booth","year":"1951","unstructured":"Booth, A.D.: A signed binary multiplication technique. Q. J. Mech. Appl. Math.\u00a04(2), 236\u2013240 (1951)","journal-title":"Q. J. Mech. Appl. Math."},{"key":"74_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/10721064_31","volume-title":"Smart Card. Research and Applications","author":"J.-F. Dhem","year":"1998","unstructured":"Dhem, J.-F., Quisquater, J.-J.: Recent results on modular multiplication for smart cards. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol.\u00a01820, pp. 336\u2013357. Springer, Heidelberg (1998)"},{"key":"74_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-36400-5_7","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"W. Fischer","year":"2003","unstructured":"Fischer, W., Seifert, J.-P.: Increasing the bitlength of a crypto-coprocessor. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 71\u201381. Springer, Heidelberg (2003)"},{"issue":"1","key":"74_CR4","first-page":"6","volume":"4","author":"H. Handschuh","year":"1998","unstructured":"Handschuh, H., Pailler, P.: Smart Card Crypto-Coprocessors for Public-Key Cryptography. CryptoBytes\u00a04(1), 6\u201311 (1998)","journal-title":"CryptoBytes"},{"key":"74_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/10721064_35","volume-title":"Smart Card. Research and Applications","author":"H. Handschuh","year":"1998","unstructured":"Handschuh, H., Pailler, P.: Smart Card Crypto-Coprocessors for Public-Key Cryptography. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol.\u00a01820, pp. 372\u2013380. Springer, Heidelberg (1998)"},{"issue":"7","key":"74_CR6","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/12.863044","volume":"49","author":"M. Joye","year":"2000","unstructured":"Joye, M., Yen, S.-M.: Optimal left-to-right binary signed-digit exponent recoding. IEEE Transactions on Computers\u00a049(7), 740\u2013748 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"74_CR7","volume-title":"Computer Arithmetic Algorithms","author":"I. Koren","year":"1998","unstructured":"Koren, I.: Computer Arithmetic Algorithms. Brookside Court Publishers, Amherst MA (1998)"},{"key":"74_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/JRPROC.1961.287779","volume":"49","author":"O.L. MacSorley","year":"1961","unstructured":"MacSorley, O.L.: High-speed arithmetic in binary computers. Proc. IRE\u00a049, 67\u201391 (1961)","journal-title":"Proc. IRE"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"Naccache, D., M\u2019Raihi, D.: Arithmetic co-processors for public-key cryptography: The state of the art. IEEE Micro, 14\u201324 (1996)","DOI":"10.1109\/40.502402"},{"key":"74_CR10","volume-title":"Computer Arithmetic","author":"B. Parhami","year":"2000","unstructured":"Parhami, B.: Computer Arithmetic. Oxford University Press, New York (2000)"},{"key":"74_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92149-9","volume-title":"Arithmetik in Rechenanlagen","author":"O. Spaniol","year":"1976","unstructured":"Spaniol, O.: Arithmetik in Rechenanlagen. B. G. Teubner, Stuttgart (1976)"},{"key":"74_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Comm. of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Comm. of the ACM"},{"key":"74_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-39118-5_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"H. Sedlak","year":"1988","unstructured":"Sedlak, H.: The RSA cryptographic Processor: The first High Speed One- Chip Solution. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0293, pp. 95\u2013105. Springer, Heidelberg (1988)"},{"key":"74_CR14","series-title":"Lecture Notes in Computer Science","first-page":"503","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"D. Waleffe de","year":"1990","unstructured":"de Waleffe, D., Quisquater, J.-J.: CORSAIR, a smart card for public-key cryptosystems. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 503\u2013513. Springer, Heidelberg (1990)"},{"key":"74_CR15","unstructured":"Walter, C.: Techniques for the Hardware Implementation of Modular Multiplication. In: Proc. of 2nd IMACS Internat. Conf. on Circuits, Systems and Computers, vol.\u00a02, pp. 945\u2013949 (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:55:46Z","timestamp":1559346946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}