{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:56:15Z","timestamp":1761580575988},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784395"},{"type":"electronic","value":"9783540784401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78440-1_13","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T10:53:32Z","timestamp":1204023212000},"page":"214-228","source":"Crossref","is-referenced-by-count":20,"title":["An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm"],"prefix":"10.1007","author":[{"given":"Miaoqing","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kris","family":"Gaj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soonhak","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarek","family":"El-Ghazawi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_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":"170","key":"13_CR2","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044(170), 519\u2013521 (April 1985)","journal-title":"Mathematics of Computation"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11894063_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"K. Gaj","year":"2006","unstructured":"Gaj, K., et al.: Implementing the elliptic curve method of factoring in reconfigurable hardware. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 119\u2013133. Springer, Heidelberg (2006)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-48059-5_10","volume-title":"Cryptographic Hardware and Embedded Systems","author":"A.F. Tenca","year":"1999","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.K.: A scalable architecture for Montgomery multiplication. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 94\u2013108. Springer, Heidelberg (1999)"},{"issue":"9","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TC.2003.1228516","volume":"52","author":"A.F. Tenca","year":"2003","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.K.: A scalable architecture for modular multiplication based on Montgomery\u2019s algorithm. IEEE Trans. Comput.\u00a052(9), 1215\u20131221 (2003)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44709-1_17","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"A.F. Tenca","year":"2001","unstructured":"Tenca, A.F., Todorov, G., Ko\u00e7, \u00c7.K.: High-radix design of a scalable modular multiplier. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 185\u2013201. Springer, Heidelberg (2001)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Harris, D., Krishnamurthy, R., Anders, M., Mathew, S., Hsu, S.: An improved unified scalable radix-2 Montgomery multiplier. In: Proc. the 17th IEEE Symposium on Computer Arithmetic (ARITH 17), June 2005, pp. 172\u2013178 (2005)","DOI":"10.1109\/ARITH.2005.9"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Michalski, E.A., Buell, D.A.: A scalable architecture for RSA cryptography on large FPGAs. In: Proc. International Conference on Field Programmable Logic and Applications (FPL 2006), August 2006, pp. 145\u2013152 (2006)","DOI":"10.1109\/FPL.2006.311207"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7.K. Ko\u00e7","year":"1996","unstructured":"Ko\u00e7, \u00c7.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro\u00a016(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"McIvor, C., McLoone, M., McCanny, J.V.: High-radix systolic modular multiplication on reconfigurable hardware. In: Proc. IEEE International Conference on Field-Programmable Technology 2005 (FPT 2005), December 2005, pp. 13\u201318 (2005)","DOI":"10.1109\/FPT.2005.1568518"},{"issue":"6","key":"13_CR11","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 Proceedings \u2013 Computers and Digital Techniques\u00a0151(6), 402\u2013408 (2004)","journal-title":"IEE Proceedings \u2013 Computers and Digital Techniques"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78440-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:09:05Z","timestamp":1619521745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78440-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784395","9783540784401"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78440-1_13","relation":{},"subject":[]}}