{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:46:28Z","timestamp":1736635588162,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540491125"},{"type":"electronic","value":"9783540491149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11927587_9","type":"book-chapter","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T05:12:43Z","timestamp":1162962763000},"page":"81-93","source":"Crossref","is-referenced-by-count":1,"title":["High-Speed RSA Crypto-processor with Radix-4 Modular Multiplication and Chinese Remainder Theorem"],"prefix":"10.1007","author":[{"given":"Bonseok","family":"Koo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongwook","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwonho","family":"Ryu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taejoo","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangjin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_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 signature and public-key cryptosystems. Comm. ACM\u00a021, 120\u2013126 (1978)","journal-title":"Comm. ACM"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TC.1983.1676262","volume":"32","author":"G.R. Blakley","year":"1983","unstructured":"Blakley, G.R.: A computer algorithm for the product ab modulo m. IEEE Trans. Comput.\u00a0C-32, 497\u2013500 (1983)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Brickell, E.F.: A fast modular multiplication algorithm with application to two-key cryptography. In: Proc. CRYPTO 1982 Advances Cryptology, pp. 51\u201360 (1982)","key":"9_CR3","DOI":"10.1007\/978-1-4757-0602-4_5"},{"key":"9_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. Math. Computation\u00a044, 519\u2013521 (1985)","journal-title":"Math. Computation"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"C.K. Koc","year":"1996","unstructured":"Koc, C.K., Acar, T., Kaliski Jr., B.S.: Analyzing and Comparing Montgomery Multiplication Algorithms. IEEE Micro.\u00a016(3), 26\u201333 (1996)","journal-title":"IEEE Micro."},{"doi-asserted-by":"crossref","unstructured":"Blum, T., Paar, C.: Montgomery modular exponentiation on reconfigurable hardware. In: Proc. 14th IEEE Symp. on Comp. Arith., pp. 70\u201377 (1999)","key":"9_CR6","DOI":"10.1109\/ARITH.1999.762831"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/12.156537","volume":"41","author":"N. Takagi","year":"1992","unstructured":"Takagi, N.: A radix-4 modular multiplication hardware algorithm for modular exponentiation. IEEE Trans. Comput.\u00a041, 949\u2013956 (1992)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Kornerup, P.: High-radix modular multiplication for cryptosystems. In: Proc. 11th IEEE Symp. Comput. Arith., Windsor, ON, Canada, June 1993, pp. 277\u2013283 (1993)","key":"9_CR8","DOI":"10.1109\/ARITH.1993.378082"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TVLSI.2003.812308","volume":"11","author":"J.-H. Hong","year":"2003","unstructured":"Hong, J.-H., Wu, C.-W.: Cellular-Array Modular Multiplier for Fast RSA Public-Key Cryptosystem Based on Modified Booth\u2019s Algorithm. IEEE Trans. on VLSI Systems\u00a011(3), 474\u2013484 (2003)","journal-title":"IEEE Trans. on VLSI Systems"},{"issue":"21","key":"9_CR10","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"C. Couvreur","year":"1982","unstructured":"Couvreur, C., Quisquater, J.J.: Fast decipherment algorithm for RSA public-key cryptosystem. Electronics letters\u00a018(21), 905\u2013907 (1982)","journal-title":"Electronics letters"},{"doi-asserted-by":"crossref","unstructured":"McIvor, C., McLoone, M., McCanny, J.V.: A high-speed, low latency RSA decryption silicon core. In: IEEE Inter. Symp. On Circuits and Systems (ISCAS), May 2003, vol.\u00a04, pp. 25\u201328 (2003)","key":"9_CR11","DOI":"10.1109\/ISCAS.2003.1205791"},{"doi-asserted-by":"crossref","unstructured":"Wu, C.-H., Hong, J.-H., Wu, C.-W.: RSA cryptosystem design based on Chinese remainder theorem. In: IEEE Proc. Asia and South Pacific Design Automation Conf. (ASP-DA), pp. 391\u2013395 (2001)","key":"9_CR12","DOI":"10.1145\/370155.370419"},{"doi-asserted-by":"crossref","unstructured":"Kwon, T.W., You, C.S., Heo, W.S., Kang, Y.K., Choi, J.R.: Two Implementation Methods of a 1024-bit RSA Cryptoprocessor Based on Modified Montgomery Algorithm. In: IEEE Inter. Symp. On Circuits and Systems (ISCAS), vol.\u00a04, pp. 650\u2013653 (2001)","key":"9_CR13","DOI":"10.1109\/ISCAS.2001.922321"},{"doi-asserted-by":"crossref","unstructured":"McIvor, C., McLoone, M., McCanny, J.V.: Fast Montgomery Modular Multiplication and RSA Cryptographic Processor Architectures. In: 37th Asilomar Conference on Signals, Systems and Computers, November 2003, vol.\u00a01(7), pp. 379\u2013384 (2003)","key":"9_CR14","DOI":"10.1109\/ACSSC.2003.1291939"},{"issue":"3","key":"9_CR15","first-page":"206","volume":"03","author":"A. Cilardo","year":"2004","unstructured":"Cilardo, A., Mazzeo, A., Romano, L., Saggese, G.P.: Carry-Save Montgomery Modular Exponentiation on Reconfigurable Hardware. IEEE Proc. on DATE 2004\u00a003(3), 206\u2013211 (2004)","journal-title":"IEEE Proc. on DATE 2004"},{"issue":"7","key":"9_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/12.936241","volume":"50","author":"T. Blum","year":"2001","unstructured":"Blum, T., Paar, C.: High-radix Montgomery modular exponentiation on reconfigurable hardware. IEEE Trans. Comput.\u00a050(7), 70\u201377 (2001)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"9_CR17","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/12.295851","volume":"43","author":"P. Kornerup","year":"1994","unstructured":"Kornerup, P.: Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms. IEEE Trans. on Comp.\u00a043(8), 892\u2013898 (1994)","journal-title":"IEEE Trans. on Comp."},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/12.210181","volume":"42","author":"C.D. Walter","year":"1993","unstructured":"Walter, C.D.: Systolic modular multiplication. IEEE Trans. on Comp.\u00a042(3), 376\u2013378 (1993)","journal-title":"IEEE Trans. on Comp."},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/12.277287","volume":"42","author":"S.E. Eldridge","year":"1993","unstructured":"Eldridge, S.E., Walter, C.D.: Hardware implementation of Montgomery\u2019s modular multiplication algorithm. IEEE Trans. on Comp.\u00a042(6), 693\u2013699 (1993)","journal-title":"IEEE Trans. on Comp."},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A.D. Booth","year":"1951","unstructured":"Booth, A.D.: A signed binary multiplication technique. Q. J. Mech. Appl. Math.\u00a04(2), 236\u2013240 (1951)","journal-title":"Q. J. Mech. Appl. Math."},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1049\/ip-cdt:19982091","volume":"145","author":"C.K. Koc","year":"1998","unstructured":"Koc, C.K., Hung, C.Y.: Fast algorithm for modular reduction. IEE Proc. -Comput. Digit. Tech.\u00a0145(4), 265\u2013271 (1998)","journal-title":"IEE Proc. -Comput. Digit. Tech."},{"unstructured":"Cho, K.-S., Ryu, J.-H., Cho, J.-D.: High-speed modular multiplication algorithm for RSA cryptosystem. In: IECON 2001, pp. 479\u2013483 (2001)","key":"9_CR22"},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1049\/ip-cdt:20040791","volume":"151","author":"C. McIvor","year":"2004","unstructured":"McIvor, C., McLoone, M., McCanny, J.V.: Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proc. -Comput. Digit. Tech.\u00a0151(6), 402\u2013408 (2004)","journal-title":"IEE Proc. -Comput. Digit. Tech."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11927587_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:20:52Z","timestamp":1736634052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11927587_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540491125","9783540491149"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11927587_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}