{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:10:51Z","timestamp":1725531051017},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008610"},{"type":"electronic","value":"9783642008627"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00862-7_23","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T13:31:05Z","timestamp":1240925465000},"page":"340-356","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients"],"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":"23_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., Paillierinst, 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":"23_CR2","unstructured":"EMV. EMV Issuer and Application Security Guidelines, Version 2.1 (2007), \n                    \n                      http:\/\/www.emvco.com\/specifications.asp?show=4"},{"key":"23_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":"170","key":"23_CR4","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","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":"23_CR5","doi-asserted-by":"publisher","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":"23_CR6","unstructured":"National Institute of Standards and Technology. NIST Special Publication 800-57 Recommendation for Key Management Part 1: General (Revised) (2007), \n                    \n                      http:\/\/csrc.nist.gov\/CryptoToolkit\/tkkeymgmt.html"},{"key":"23_CR7","unstructured":"National Institute of Standards and Technology. NIST Special Publication 800-78-1, Cryptographic Algorithms and Key Sizes for Personal Identity Verification (2007) \n                    \n                      http:\/\/csrc.nist.gov\/CryptoToolkit\/tkkeymgmt.html"},{"key":"23_CR8","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":"23_CR9","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, p. 223. Springer, Heidelberg (1999)"},{"issue":"2","key":"23_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":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-74462-7_14","volume-title":"Selected Areas in Cryptography","author":"M. Yoshino","year":"2007","unstructured":"Yoshino, M., Okeya, K., Vuillaume, C.: Unbridle the bit-length of a crypto-coprocessor with montgomery multiplication. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 188\u2013202. Springer, Heidelberg (2007)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-73458-1_18","volume-title":"Information Security and Privacy","author":"M. Yoshino","year":"2007","unstructured":"Yoshino, M., Okeya, K., Vuillaume, C.: Double-size bipartite modular multiplication. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 230\u2013244. Springer, Heidelberg (2007)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-85893-5_6","volume-title":"Smart Card Research and Advanced Applications","author":"M. Yoshino","year":"2008","unstructured":"Yoshino, M., Okeya, K., Vuillaume, C.: A Black Hen Lays White Eggs: Bipartite Multiplier Out of Montgomery One for On-Line RSA Verification. In: Grimaud, G., Standaert, F.-X. (eds.) CARDIS 2008. LNCS, vol.\u00a05189, pp. 74\u201388. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00862-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:27:10Z","timestamp":1552004830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00862-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008610","9783642008627"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00862-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}