{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:15Z","timestamp":1725535995358},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030949"},{"type":"electronic","value":"9783642030956"}],"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-03095-6_41","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T17:40:55Z","timestamp":1248975655000},"page":"428-438","source":"Crossref","is-referenced-by-count":3,"title":["Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique"],"prefix":"10.1007","author":[{"given":"Chia-Long","family":"Wu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"41_CR1","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., Adleman, L.: 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"},{"issue":"4","key":"41_CR2","doi-asserted-by":"publisher","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. on Inform. Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"14","key":"41_CR3","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/S1383-7621(02)00058-9","volume":"47","author":"G. Alia","year":"2002","unstructured":"Alia, G., Martinelli, E.: Fast modular exponentiation of large numbers with large exponents. Journal of Systems Architecture\u00a047(14), 1079\u20131088 (2002)","journal-title":"Journal of Systems Architecture"},{"issue":"170","key":"41_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"},{"issue":"7","key":"41_CR5","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/12.936241","volume":"50","author":"T. Blum","year":"2001","unstructured":"Blum, T., Parr, C.: High-radix Montgomery modular exponentiation on re- configurable hardware. IEEE Trans. on Computers\u00a050(7), 759\u2013764 (2001)","journal-title":"IEEE Trans. on Computers"},{"issue":"11","key":"41_CR6","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1049\/el:19960662","volume":"32","author":"D.-C. Lou","year":"1996","unstructured":"Lou, D.-C., Chang, C.-C.: Fast exponentiation method obtained by folding the exponent in half. Electronics Letters\u00a032(11), 984\u2013985 (1996)","journal-title":"Electronics Letters"},{"issue":"1","key":"41_CR7","first-page":"89","volume":"E.86-A","author":"H. Nozaki","year":"2003","unstructured":"Nozaki, H., Shimbo, A., Kawamura, S.: RNS Montgomery multiplication for duplicate processing of base transformations. IEICE Trans. on Fundamentals\u00a0E.86-A(1), 89\u201397 (2003)","journal-title":"IEICE Trans. on Fundamentals"},{"issue":"7","key":"41_CR8","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/12.863044","volume":"49","author":"M. Joye","year":"2000","unstructured":"Joye, M., Yen, S.-M.: Optimal left-to-right binary signed-digit recoding. IEEE Trans. on Computers\u00a049(7), 740\u2013748 (2000)","journal-title":"IEEE Trans. on Computers"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Chang, C.-C., Kuo, Y.-T., Lin, C.-H.: Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements. In: Proceedings of the 17th IEEE Symposium on Advanced Inform. Networking and Applications, March 2003, pp. 807\u2013811 (2003)","DOI":"10.1109\/AINA.2003.1193005"},{"key":"41_CR10","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"41_CR11","volume-title":"The Art of Computer Programming, Seminumerical Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Seminumerical Algorithms, 3rd edn., vol.\u00a0II. Addison-Wesley, MA (1997)","edition":"3"},{"issue":"17","key":"41_CR12","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1049\/el:19931055","volume":"29","author":"S.-M. Yen","year":"1993","unstructured":"Yen, S.-M., Laih, C.-S.: Common-multiplicand multiplication and its applications to public key cryptography. Electronics Letters\u00a029(17), 1583\u20131584 (1993)","journal-title":"Electronics Letters"},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-36400-5_5","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"S. Gueron","year":"2003","unstructured":"Gueron, S.: Enhanced Montgomery multiplication. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 46\u201356. Springer, Heidelberg (2003)"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-46877-3_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"S.R. Dusse","year":"1991","unstructured":"Dusse, S.R., Kaliski, B.S.: A cryptographic library for the motorola DSP 56000. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 230\u2013244. Springer, Heidelberg (1991)"},{"issue":"2","key":"41_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(98)00031-3","volume":"66","author":"J.-C. Ha","year":"1998","unstructured":"Ha, J.-C., Moon, S.-J.: A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. Information Processing Letters\u00a066(2), 105\u2013107 (1998)","journal-title":"Information Processing Letters"},{"key":"41_CR16","first-page":"231","volume-title":"Advances in Computers","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. In: Advances in Computers, vol.\u00a01, pp. 231\u2013308. Academic Education Press, NY (1960)"},{"issue":"3","key":"41_CR17","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","volume":"EC-10","author":"A. Avizienis","year":"1961","unstructured":"Avizienis, A.: Signed digit number representation for fast parallel arithmetic. IRE Trans. on Electronic Computers\u00a0EC-10(3), 389\u2013400 (1961)","journal-title":"IRE Trans. on Electronic Computers"},{"key":"41_CR18","volume-title":"Computer Arithmetic, Principles, Architecture and Design","author":"K. Hwang","year":"1979","unstructured":"Hwang, K.: Computer Arithmetic, Principles, Architecture and Design. John Wiley & Sons, NY (1979)"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Manochehri, K., Pourmozafari, S.: Modified radix-2 Montgomery modular multiplication to make it faster and simpler. In: Proceedings of the IEEE Conference on Information Technology: Coding and Computing (ITCC), vol.\u00a01, pp. 598\u2013602 (2005)","DOI":"10.1109\/ITCC.2005.204"},{"issue":"2","key":"41_CR20","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/MP.2005.1462460","volume":"24","author":"L.A. Tawalbeh","year":"2005","unstructured":"Tawalbeh, L.A., Tenca, A.F., Koc, C.K.: A radix-4 scalable design. IEEE Potentials\u00a024(2), 16\u201318 (2005)","journal-title":"IEEE Potentials"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Fournaris, A.P., Koufopavlou, O.: A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication. In: Proceedings of the IEEE Symposium on Circuits and Systems (ISCAS), vol.\u00a05, pp. 4645\u20134648 (2005)","DOI":"10.1109\/ISCAS.2005.1465668"},{"issue":"8","key":"41_CR22","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/12.238495","volume":"42","author":"S. Arno","year":"1993","unstructured":"Arno, S., Wheeler, F.S.: Signed digit representations of minimal Hamming weight. IEEE Trans. on Computers\u00a042(8), 1007\u20131010 (1993)","journal-title":"IEEE Trans. on Computers"},{"issue":"12","key":"41_CR23","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1109\/TCAD.2002.804374","volume":"21","author":"I.-C. Park","year":"2002","unstructured":"Park, I.-C., Kang, H.-J.: Digital filter synthesis based on an algorithm to generate all minimal signed digit representation. IEEE Trans. on Computers-Aided Design of Integrated Circuits and Systems\u00a021(12), 1525\u20131529 (2002)","journal-title":"IEEE Trans. on Computers-Aided Design of Integrated Circuits and Systems"},{"issue":"5","key":"41_CR24","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/12.926155","volume":"50","author":"N. Takagi","year":"2001","unstructured":"Takagi, N., Yoshiki, J., Takagi, K.: A fast algorithm for multiplicative inversion in GF(2n) using normal basis. IEEE Trans. on Computers\u00a050(5), 394\u2013398 (2001)","journal-title":"IEEE Trans. on Computers"},{"issue":"10","key":"41_CR25","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1109\/TC.2007.1084","volume":"56","author":"J.P. David","year":"2007","unstructured":"David, J.P., Kalach, K., Tittley, N.: Hardware complexity of modular multiplication and exponentiation. IEEE Trans. on Computers\u00a056(10), 1308\u20131319 (2007)","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03095-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:06:12Z","timestamp":1552118772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03095-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030949","9783642030956"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03095-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}