{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:18:22Z","timestamp":1725491902901},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744610"},{"type":"electronic","value":"9783540744627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74462-7_14","type":"book-chapter","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T06:37:28Z","timestamp":1189665448000},"page":"188-202","source":"Crossref","is-referenced-by-count":3,"title":["Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery 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":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 214\u2013227. Springer, Heidelberg (2003)"},{"key":"14_CR2","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 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":"14_CR3","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)"},{"issue":"5","key":"14_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1049\/ip-cdt:19941291","volume":"141","author":"C. Koc","year":"1994","unstructured":"Koc, C.: Montgomery reduction with even modulus. IEE Proceedings Computer and Digital Techniques\u00a0141(5), 314\u2013316 (1994)","journal-title":"IEE Proceedings Computer and Digital Techniques"},{"key":"14_CR5","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)"},{"issue":"170","key":"14_CR6","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":"14_CR7","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":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49162-7_18","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":"21","key":"14_CR9","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"},{"issue":"2","key":"14_CR10","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":"14_CR11","unstructured":"RSA Laboratories: RSA challenges, \n                    \n                      http:\/\/www.rsasecurity.com\/rsalabs\/"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74462-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:30:34Z","timestamp":1619519434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74462-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744610","9783540744627"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74462-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}