{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:15:32Z","timestamp":1743124532951,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858928"},{"type":"electronic","value":"9783540858935"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-85893-5_6","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T02:28:18Z","timestamp":1219976898000},"page":"74-88","source":"Crossref","is-referenced-by-count":1,"title":["A Black Hen Lays White Eggs"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Yoshino","sequence":"first","affiliation":[]},{"given":"Katsuyuki","family":"Okeya","sequence":"additional","affiliation":[]},{"given":"Camille","family":"Vuillaume","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1049\/ip-cdt:19941291","volume":"141","author":"\u00c7.K. Ko\u00e7.","year":"1994","unstructured":"Ko\u00e7., \u00c7.K.: Montgomery Reduction with Even Modulus. IEE Proceedings - Computers and Digital Techniques\u00a0141(5), 314\u2013316 (1994)","journal-title":"IEE Proceedings - Computers and Digital Techniques"},{"key":"6_CR2","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":"6_CR3","unstructured":"European Network of Excellence in Cryptology (ECRYPT). ECRYPT Yearly Report on Algorithms and Keysizes (2006), \n                  \n                    http:\/\/www.ecrypt.eu.org\/documents\/D.SPA.21-1.1.pdf"},{"key":"6_CR4","unstructured":"EMV. EMV Issuer and Application Security Guidelines, Version 2.1 (2007), \n                  \n                    http:\/\/www.emvco.com\/specifications.asp?show=4"},{"key":"6_CR5","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":"6_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)"},{"key":"6_CR7","unstructured":"Arjen, K.: Lenstra. Key Lengths (2004), \n                  \n                    http:\/\/cm.bell-labs.com\/who\/akl\/key_lengths.pdf"},{"issue":"170","key":"6_CR8","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":"6_CR9","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":"6_CR10","unstructured":"National Institute of Standards ant Technology. NIST Special Publication 800-57 Recommendation for KeyManagement Part 1: General (Revised) (2007), \n                  \n                    http:\/\/csrc.nist.gov\/CryptoToolkit\/tkkeymgmt.html"},{"key":"6_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":"6_CR12","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":"2","key":"6_CR13","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":"6_CR14","unstructured":"RSA Laboratories. The Secure Use of RSA. CryptoBytes 1(3) (1995), \n                  \n                    ftp:\/\/ftp.rsasecurity.com\/pub\/cryptobytes\/crypto1n3.pdf"},{"key":"6_CR15","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":"6_CR16","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)"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85893-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:41:57Z","timestamp":1578526917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85893-5_6"}},"subtitle":["Bipartite Multiplier Out of Montgomery One for On-Line RSA Verification"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540858928","9783540858935"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85893-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}