{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:06:06Z","timestamp":1781885166707,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540675174","type":"print"},{"value":"9783540455394","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_37","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:26:08Z","timestamp":1184603168000},"page":"523-538","source":"Crossref","is-referenced-by-count":94,"title":["Cox-Rower Architecture for Fast Parallel Montgomery Multiplication"],"prefix":"10.1007","author":[{"given":"Shinichi","family":"Kawamura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masanobu","family":"Koike","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fumihiko","family":"Sano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Atsushi","family":"Shimbo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"issue":"2","key":"37_CR1","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/12.16508","volume":"38","author":"A. P. Shenoy","year":"1989","unstructured":"A. P. Shenoy, R. Kumaresan, \u201cFast Base Extension Using a Redundant Modulus in RNS,\u201d IEEE Trans. on Computers, Vol.38, No.2, pp.292\u2013297, Feb. 1989.","journal-title":"IEEE Trans. on Computers"},{"issue":"9","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1109\/31.7577","volume":"35","author":"A. P. Shenoy","year":"1988","unstructured":"A. P. Shenoy, R. Kumaresan, \u201cResidue to Binary Conversion for RNS Arithmetic Using Only Modular Look-up Tables,\u201d IEEE Trans. on Circuit and Systems, Vol.35, No.9, pp.1158\u20131162, Sep. 1988.","journal-title":"IEEE Trans. on Circuit and Systems"},{"issue":"12","key":"37_CR3","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/TCS.1983.1085311","volume":"30","author":"M. A. Soderstrand","year":"1983","unstructured":"M. A. Soderstrand, C. Vernia, Jui-Hua Chang \u201cAn Improved Residue Number System Digital-to-Analog Converter,\u201d IEEE Trans. on Circuit and Systems, Vol.30, No.12, pp.903\u2013907, Dec. 1983.","journal-title":"IEEE Trans. on Circuit and Systems"},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TC.1983.1676242","volume":"32","author":"C. H. Huang","year":"1983","unstructured":"C. H. Huang, \u201cA Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number Applications,\u201d IEEE Trans. on Computers, Vol.32, No.4, pp.398\u2013402, April, 1983.","journal-title":"IEEE Trans. on Computers"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.-J. Quisquater","year":"1982","unstructured":"J.-J. Quisquater, C. Couvreur, \u201cFast Decipherment Algorithm for RSA Public-Key Cryptosystem,\u201d Electronics Letters, Vol.18, pp.905\u2013907, Oct., 1982.","journal-title":"Electronics Letters"},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, L. Adleman, \u201cA Method for Obtaining Digital Signatures and Public Key Cryptosystems,\u201d Communications of the ACM, Vol.21, No.2, pp.120\u2013126, Feb., 1978.","journal-title":"Communications of the ACM"},{"issue":"5","key":"37_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"K. C. Posch","year":"1995","unstructured":"K. C. Posch, R. Posch, \u201cModulo Reduction in Residue Number Systems,\u201d IEEE Trans. on Parallel and Distributed Systems, Vol.6, No.5, pp.449\u2013454, May 1995.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"7","key":"37_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0167-4048(99)80061-3","volume":"17","author":"J. Schwemmlein","year":"1998","unstructured":"J. Schwemmlein, K. C. Posch, R. Posch, \u201cRNS-Modulo Reduction Upon a Restricted Base Value Set and its Applicability to RSA Cryptography,\u201d Computer & Security, Vol.17, No.7, pp.637\u2013650, 1998.","journal-title":"Computer & Security"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Jean-Claud Bajard, Laurent-Stephane Didier, Peter Kornerup, \u201cAn RNS Montgomery Multiplication Algorithm,\u201d Proceedings of ARITH13, IEEE Computer Society, pp.234\u2013239, July 1997.","DOI":"10.1109\/ARITH.1997.614900"},{"issue":"7","key":"37_CR10","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/12.709376","volume":"47","author":"J.-C. Bajard","year":"1998","unstructured":"Jean-Claud Bajard, Laurent-Stephane Didier, Peter Kornerup, \u201cAn RNS Montgomery Multiplication Algorithm,\u201d IEEE Trans. on Computers, Vol.47, No.7, pp.766\u2013776, 1998.","journal-title":"IEEE Trans. on Computers"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Pascal Paillier, \u201cLow-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor,\u201d Proc. of PKC\u201999, pp.223\u2013234, 1999.","DOI":"10.1007\/3-540-49162-7_18"},{"key":"37_CR12","first-page":"268","volume":"2","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol.2, Seminumerical Algorithms, Second Edition, pp.268\u2013276, Addison-Wesley, 1981.","journal-title":"The Art of Computer Programming"},{"issue":"170","key":"37_CR13","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 Mathematics of Computation, Vol.44, No.170, pp.519\u2013521, April, 1985.","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:59:15Z","timestamp":1737287955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}