{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T23:40:13Z","timestamp":1738280413128,"version":"3.35.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,5]],"date-time":"2008-07-05T00:00:00Z","timestamp":1215216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10207-008-0060-3","type":"journal-article","created":{"date-parts":[[2008,7,4]],"date-time":"2008-07-04T14:22:34Z","timestamp":1215181354000},"page":"13-23","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite modular multiplication with twice the bit-length of multipliers"],"prefix":"10.1007","volume":"8","author":[{"given":"Masayuki","family":"Yoshino","sequence":"first","affiliation":[]},{"given":"Katsuyuki","family":"Okeya","sequence":"additional","affiliation":[]},{"given":"Camille","family":"Vuillaume","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,5]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Bajard, J.-C., Didier, L.-S., Kornerup, P.: An RNS Montgomery Modular Multiplication Algorithm, Proceedings of ARITH13, pp. 234\u2013239. IEEE Computer Society, New York (1997)","DOI":"10.1109\/ARITH.1997.614900"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Chevallier-Mames, B., Joye, M., Paillier, P.: Faster double-size modular multiplication from Euclidean multipliers. In: Proceedings of Workshop on Cryptographic Hardware and Embedded Systems (CHES\u201903). Lecture Notes in Computer Science, vol. 2779, pp. 214\u2013227 (2003)","DOI":"10.1007\/10931455_18"},{"key":"60_CR3","unstructured":"National Institute for Standards and Technology (NIST). FIPS 186, Digital signature standard, 1994. http:\/\/www.itl.nist.gov\/fipspubs\/fip186.htm"},{"issue":"4","key":"60_CR4","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Elgamal","year":"1985","unstructured":"Elgamal T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"60_CR5","unstructured":"EMVco. EMV Issuer and Application Security Guidelines, Version 1.3, 2005, http:\/\/www.emvco.com\/specifications.asp?show=4"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Fischer, W., Seifert, J.-P.: Increasing the bitlength of crypto-coprocessors. In: Proc. Workshop on Cryptographic Hardware and Embedded Systems (CHES\u201902), Lecture Notes in Computer Science, vol. 2523, pp. 71\u201381 (2003)","DOI":"10.1007\/3-540-36400-5_7"},{"key":"60_CR7","unstructured":"Infineon Technologies AG. Security and Chipcard ICs, Evaluation Documentation, SLE66CX162PE \/ m1531-a24, SLE66CX80PE\/ m1533-a24, Both with RSA 2048 v1.4, Security Target, 2005. http:\/\/www.commoncriteriaportal.org\/public\/files\/epfiles\/0351b.pdf"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Kaihara, M.E., Takagi, N.: Bipartite modular multiplication. In: Proceedings of Workshop on Cryptographic Hardware and Embedded Systems (CHES\u201905), Lecture Notes in Computer Science, vol. 3659, pp. 201\u2013210 (2005)","DOI":"10.1007\/11545262_15"},{"issue":"4","key":"60_CR9","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. Cryptol. 14(4), 255\u2013293 (2001)","journal-title":"J. Cryptol."},{"issue":"170","key":"60_CR10","doi-asserted-by":"crossref","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. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"60_CR11","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":"60_CR12","unstructured":"National Institute of Standards ant Technology, NIST Special Publication 800-57 DRAFT, Recommendation for KeyManagement Part 1: General (2006), http:\/\/csrc.nist.gov\/CryptoToolkit\/tkkeymgmt.html"},{"key":"60_CR13","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":"60_CR14","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor. In: Public Key Cryptography. Lecture Notes in Computer Science, vol. 1560, pp. 223\u2013234 (1999)","DOI":"10.1007\/3-540-49162-7_18"},{"issue":"5","key":"60_CR15","doi-asserted-by":"crossref","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 Trans. Parallel Distributed Syst. 6(5), 449\u2013454 (1995)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"issue":"21","key":"60_CR16","doi-asserted-by":"crossref","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. Electr. Lett. 18(21), 905\u2013907 (1982)","journal-title":"Electr. Lett."},{"key":"60_CR17","unstructured":"Renesas Technology Corp. AE45X1-C(HD65145X1) Version 02 Smartcard Security Target, Public Version, 2006. http:\/\/www.commoncriteriaportal.org\/public\/files\/epfiles\/0351b.pdf"},{"key":"60_CR18","unstructured":"RSA Laboratories, RSA challenges, http:\/\/www.rsa.com\/rsalabs"},{"issue":"2","key":"60_CR19","doi-asserted-by":"crossref","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. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Yoshino, M., Okeya, K., Vuillaume, C.: Unbridle the Bit-length of a crypto-coprocessor with montgomery multiplication. In: Proceedings of the 13th Annual Workshop on Selected Areas in Cryptography (SAC\u201906). Lecture Notes in Computer Science vol. 4356, pp. 188\u2013202 (2007)","DOI":"10.1007\/978-3-540-74462-7_14"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-008-0060-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-008-0060-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-008-0060-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T23:09:14Z","timestamp":1738278554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-008-0060-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s10207-008-0060-3","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2008,7,5]]}}}