{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:16Z","timestamp":1737288616858,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48686-0_44","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:12Z","timestamp":1184601252000},"page":"442-451","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Fixed-Size Systolic Arrays for the Modular Multiplication"],"prefix":"10.1007","author":[{"given":"Sung-Woo","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun-Sung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung-Joon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tae-Geun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kee-Young","family":"Yoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"issue":"6","key":"44_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew Directions in Cryptography,\u201d IEEE Trans. on Info. Theory, vol. IT-22(6) (1976) 644\u2013654","journal-title":"IEEE Trans. on Info. Theory"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, and L. Adleman, \u201cA Method for Obtaining Digital Signatures and Public-key Cryptosystems,\u201d Commu. ACM. vol. 21 (1978) 120\u2013126","journal-title":"Commu. ACM."},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"P.L. Montgomery, \u201cModular Multiplication Without Trial Division,\u201d Mathemat. of Computat. vol. 44 (1985) 519\u2013521","journal-title":"Mathemat. of Computat."},{"key":"44_CR4","unstructured":"Antoon Bosselaers, Rene Govaerts, and Joos Vandewalle, \u201cComparison of three modular reduction functions,\u201d Advances in Cryptology-CRYPTO '93 (1993) 175\u2013186"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"S.R. Dusse and B.S. Kaliski Jr., \u201cA Cryptographic Library for the Motorola DSP56000,\u201d in Advances in Cryptology EUROCRYPT '90, Springer-Verlag (1991) 230\u2013244","DOI":"10.1007\/3-540-46877-3_21"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/12.277287","volume":"42","author":"S.E. Eldridge","year":"1993","unstructured":"S.E. Eldridge and C.D. Walter, \u201cHardware Implementation of Montgomery's Modular Multiplication Algorithm,\u201d IEEE Trans. Comput. vol. 42 (1993) 693\u2013699","journal-title":"IEEE Trans. Comput."},{"key":"44_CR7","unstructured":"K. Iwamura, T. Matsumoto, and H. Imai, \u201cSystolic Arrays for Modular Exponentiation using Montgomery Method,\u201d Proc. Euro CRYPT '92 (1992) 477\u2013481"},{"key":"44_CR8","unstructured":"J. Sauerbrey, \u201cA Modular Exponentiation unit based on Systolic Arrays,\u201d Abst. AUSCRYPT '92 (1992) 1219\u20131224"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/12.210181","volume":"42","author":"C.D. Walter","year":"1993","unstructured":"C.D. Walter, \u201cSystolic Modular Multiplication,\u201d IEEE Trans. on Computers, vol. 42 (1993) 376\u2013378","journal-title":"IEEE Trans. on Computers"},{"key":"44_CR10","unstructured":"S.Y. Kung, VLSI Array Processors, Prentice-Hall (1987)"},{"key":"44_CR11","unstructured":"K.Y. Yoo, \u201cA Systolic Array Design Methodology for Sequential Loop Algorithms,\u201d Ph.D. thesis, Rensselaer Polytechnic Institute (1992)"},{"key":"44_CR12","unstructured":"Y.J. Heo, K.J. Lee and K.Y. Yoo, \u201cAn optimal linear systolic array for computing montgomery modular multiplication\u201d, PDCS '98 (1998)"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Po-Song Chen, Shih-Arn Hwang and Cheng-Wen Wu, \u201cA systolic RSA public key cryptosystem\u201d, IEEE International Symposium on Circuits and Systems, vol. 4 (1996)","DOI":"10.1109\/ISCAS.1996.541988"},{"issue":"1","key":"44_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"C-35","author":"D.I. Moldovan","year":"1986","unstructured":"D.I. Moldovan and J.A.B. Fortes, \u201cPartitioning and Mapping Algorithms into Fixed Size Systolic Arrays\u201d, IEEE transaction on Computers, vol. C-35,no.1, January (1986) 1\u201312","journal-title":"IEEE transaction on Computers"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:42:40Z","timestamp":1737286960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}