{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:23Z","timestamp":1725487103681},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73458-1_18","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:09:27Z","timestamp":1183547367000},"page":"230-244","source":"Crossref","is-referenced-by-count":2,"title":["Double-Size Bipartite Modular Multiplication"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Yoshino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuyuki","family":"Okeya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camille","family":"Vuillaume","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"234","volume-title":"Proceedings of ARITH13","author":"J.-C. Bajard","year":"1997","unstructured":"Bajard, J.-C., Didier, L.-S., Kornerup, P.: An RNS Montgomery Modular Multiplication Algorithm. In: Proceedings of ARITH13, pp. 234\u2013239. IEEE Computer Society, Los Alamitos (1997)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/10931455_18","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"B. Chevallier-Mames","year":"2003","unstructured":"Chevallier-Mames, B., Joye, M., Paillier, P.: Faster Double-Size Modular Multiplication From Euclidean Multipliers. In: D.Walter, C., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 214\u2013227. Springer, Heidelberg (2003)"},{"key":"18_CR3","unstructured":"EMVco. EMV Issuer and Application Security Guidelines, Version 1.3 (2005), \n                    \n                      http:\/\/www.emvco.com\/specifications.asp?show=4"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","first-page":"71","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"W. Fischer","year":"2003","unstructured":"Fischer, W., Seifert, J.-P.: Increasing the bitlength of crypto-coprocessors. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 71\u201381. Springer, Heidelberg (2003)"},{"key":"18_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":"2000","unstructured":"Handschuh, H., Paillier, P.: Smart card crypto-coprocessors for public-key cryptography. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol.\u00a01820, pp. 372\u2013379. Springer, Heidelberg (2000)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11545262_15","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"M.E. Kaihara","year":"2005","unstructured":"Kaihara, M.E., Takagi, N.: Bipartite modular multiplication. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 201\u2013210. Springer, Heidelberg (2005)"},{"issue":"4","key":"18_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting Cryptographic Key Sizes. J. Cryptology\u00a014(4), 255\u2013293 (2001)","journal-title":"J. Cryptology"},{"issue":"170","key":"18_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"18_CR9","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"18_CR10","unstructured":"National Institute of Standards ant Technology, NIST Special Publication 800-57 DRAFT, Recommendation for KeyManagement Part 1: General (2006), \n                    \n                      http:\/\/csrc.nist.gov\/CryptoToolkit\/tkkeymgmt.html"},{"key":"18_CR11","unstructured":"Naccache, D., M\u2019Ra\u00efhi, D.: Arithmetic co-processors for public-key cryptography: The state of the art. In: CARDIS, pp. 18\u201320 (1996)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Public Key Cryptography","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 223\u2013234. Springer, Heidelberg (1999)"},{"issue":"5","key":"18_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"K.C. Posch","year":"1995","unstructured":"Posch, K.C., Posch, R.: Modulo reduction in Residue Number Systems. IEEE Transactions on Parallel and Distributed Systems\u00a06(5), 449\u2013454 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"21","key":"18_CR14","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.-J. Quisquater","year":"1982","unstructured":"Quisquater, J.-J., Couvreur, C.: Fast decipherment algorithm for rsa public-key cryptosystem. Electronics Letters\u00a018(21), 905\u2013907 (1982)","journal-title":"Electronics Letters"},{"key":"18_CR15","unstructured":"RSA Laboratories, RSA challenges, \n                    \n                      http:\/\/www.rsa.com\/rsalabs"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adelman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"18_CR17","unstructured":"Yoshino, M., Okeya, K., Vuillaume, C.: Unbridle the Bit-Length of a Crypto-Coprocessor with Montgomery Multiplication. In: Preproceedings of the 13th Annual Workshop on Selected Areas in Cryptography (SAC\u201906), pp. 184\u2013198 (2006)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73458-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:15:29Z","timestamp":1605744929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73458-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734574"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73458-1_18","relation":{},"subject":[]}}